./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:14:54,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:14:54,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:14:54,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:14:54,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:14:54,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:14:54,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:14:54,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:14:54,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:14:54,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:14:54,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:14:54,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:14:54,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:14:54,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:14:54,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:14:54,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:14:54,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:14:54,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:14:54,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:14:54,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:14:54,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:14:54,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:14:54,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:14:54,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:14:54,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:14:54,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:14:54,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:14:54,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:14:54,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:14:54,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:14:54,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:14:54,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:14:54,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:14:54,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:14:54,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:14:54,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:14:54,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:14:54,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:14:54,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:14:54,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:14:54,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:14:54,293 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:14:54,313 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:14:54,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:14:54,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:14:54,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:14:54,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:14:54,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:14:54,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:14:54,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:14:54,315 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:14:54,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:14:54,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:14:54,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:14:54,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:14:54,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:14:54,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:14:54,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:14:54,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:14:54,317 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:14:54,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:14:54,317 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:14:54,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:14:54,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:14:54,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:14:54,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:14:54,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:14:54,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:14:54,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:14:54,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:14:54,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:14:54,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:14:54,319 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:14:54,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:14:54,320 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:14:54,320 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:14:54,320 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:14:54,320 INFO L138 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_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/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_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2022-12-13 13:14:54,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:14:54,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:14:54,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:14:54,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:14:54,518 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:14:54,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_9.c [2022-12-13 13:14:57,158 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:14:57,286 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:14:57,286 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/sv-benchmarks/c/locks/test_locks_9.c [2022-12-13 13:14:57,291 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/data/5d069a3bb/432d6dc24fca48309cb2c5e7b1854f9b/FLAG8bf39c7d1 [2022-12-13 13:14:57,302 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/data/5d069a3bb/432d6dc24fca48309cb2c5e7b1854f9b [2022-12-13 13:14:57,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:14:57,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:14:57,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:14:57,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:14:57,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:14:57,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b95828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57, skipping insertion in model container [2022-12-13 13:14:57,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:14:57,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:14:57,443 WARN L237 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_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2022-12-13 13:14:57,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:14:57,454 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:14:57,472 WARN L237 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_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2022-12-13 13:14:57,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:14:57,483 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:14:57,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57 WrapperNode [2022-12-13 13:14:57,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:14:57,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:14:57,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:14:57,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:14:57,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,516 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-12-13 13:14:57,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:14:57,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:14:57,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:14:57,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:14:57,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,535 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:14:57,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:14:57,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:14:57,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:14:57,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (1/1) ... [2022-12-13 13:14:57,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:14:57,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:14:57,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:14:57,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:14:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:14:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:14:57,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:14:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:14:57,661 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:14:57,663 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:14:57,812 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:14:57,818 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:14:57,819 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 13:14:57,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:14:57 BoogieIcfgContainer [2022-12-13 13:14:57,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:14:57,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:14:57,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:14:57,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:14:57,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:14:57" (1/3) ... [2022-12-13 13:14:57,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e6b34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:14:57, skipping insertion in model container [2022-12-13 13:14:57,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:57" (2/3) ... [2022-12-13 13:14:57,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e6b34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:14:57, skipping insertion in model container [2022-12-13 13:14:57,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:14:57" (3/3) ... [2022-12-13 13:14:57,830 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-12-13 13:14:57,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:14:57,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:14:57,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:14:57,896 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=LoopsAndPotentialCycles, 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;@16d36cca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:14:57,896 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 13:14:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 13:14:57,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:57,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:57,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2022-12-13 13:14:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:57,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045550313] [2022-12-13 13:14:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045550313] [2022-12-13 13:14:58,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045550313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706314036] [2022-12-13 13:14:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,087 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,121 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2022-12-13 13:14:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 13:14:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,130 INFO L225 Difference]: With dead ends: 77 [2022-12-13 13:14:58,130 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 13:14:58,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,135 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 13:14:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-12-13 13:14:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2022-12-13 13:14:58,168 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2022-12-13 13:14:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,169 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2022-12-13 13:14:58,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2022-12-13 13:14:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 13:14:58,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:14:58,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2022-12-13 13:14:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227493829] [2022-12-13 13:14:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227493829] [2022-12-13 13:14:58,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227493829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098314715] [2022-12-13 13:14:58,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,237 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,255 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-12-13 13:14:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 13:14:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,256 INFO L225 Difference]: With dead ends: 104 [2022-12-13 13:14:58,256 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 13:14:58,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,257 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 13:14:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-12-13 13:14:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2022-12-13 13:14:58,264 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2022-12-13 13:14:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,265 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2022-12-13 13:14:58,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2022-12-13 13:14:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 13:14:58,265 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:14:58,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2022-12-13 13:14:58,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829634412] [2022-12-13 13:14:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829634412] [2022-12-13 13:14:58,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829634412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681105593] [2022-12-13 13:14:58,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,318 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,336 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2022-12-13 13:14:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-13 13:14:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,338 INFO L225 Difference]: With dead ends: 96 [2022-12-13 13:14:58,338 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 13:14:58,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,340 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 13:14:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-12-13 13:14:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2022-12-13 13:14:58,349 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2022-12-13 13:14:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,349 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2022-12-13 13:14:58,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2022-12-13 13:14:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 13:14:58,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:14:58,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2022-12-13 13:14:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710289721] [2022-12-13 13:14:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710289721] [2022-12-13 13:14:58,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710289721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998220678] [2022-12-13 13:14:58,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,404 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,425 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2022-12-13 13:14:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-13 13:14:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,426 INFO L225 Difference]: With dead ends: 121 [2022-12-13 13:14:58,427 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 13:14:58,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,428 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 13:14:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2022-12-13 13:14:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2022-12-13 13:14:58,437 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2022-12-13 13:14:58,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,438 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2022-12-13 13:14:58,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2022-12-13 13:14:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 13:14:58,439 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:14:58,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2022-12-13 13:14:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208993700] [2022-12-13 13:14:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208993700] [2022-12-13 13:14:58,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208993700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472011959] [2022-12-13 13:14:58,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,479 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,493 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2022-12-13 13:14:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-13 13:14:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,494 INFO L225 Difference]: With dead ends: 201 [2022-12-13 13:14:58,495 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 13:14:58,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,496 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 13:14:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-12-13 13:14:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2022-12-13 13:14:58,502 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2022-12-13 13:14:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,502 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2022-12-13 13:14:58,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2022-12-13 13:14:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:14:58,503 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:14:58,503 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2022-12-13 13:14:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958877132] [2022-12-13 13:14:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958877132] [2022-12-13 13:14:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958877132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666873098] [2022-12-13 13:14:58,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,529 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,542 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2022-12-13 13:14:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 13:14:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,544 INFO L225 Difference]: With dead ends: 180 [2022-12-13 13:14:58,544 INFO L226 Difference]: Without dead ends: 123 [2022-12-13 13:14:58,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,545 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-13 13:14:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-12-13 13:14:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2022-12-13 13:14:58,551 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2022-12-13 13:14:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,552 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2022-12-13 13:14:58,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2022-12-13 13:14:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:14:58,552 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:14:58,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2022-12-13 13:14:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623488886] [2022-12-13 13:14:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623488886] [2022-12-13 13:14:58,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623488886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496280729] [2022-12-13 13:14:58,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,578 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,592 INFO L93 Difference]: Finished difference Result 345 states and 593 transitions. [2022-12-13 13:14:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 13:14:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,593 INFO L225 Difference]: With dead ends: 345 [2022-12-13 13:14:58,593 INFO L226 Difference]: Without dead ends: 231 [2022-12-13 13:14:58,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,594 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-12-13 13:14:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-12-13 13:14:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2022-12-13 13:14:58,604 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2022-12-13 13:14:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,604 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2022-12-13 13:14:58,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2022-12-13 13:14:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:14:58,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:14:58,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2022-12-13 13:14:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329845749] [2022-12-13 13:14:58,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329845749] [2022-12-13 13:14:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329845749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948845022] [2022-12-13 13:14:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,630 INFO L87 Difference]: Start difference. First operand 229 states and 387 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,641 INFO L93 Difference]: Finished difference Result 289 states and 493 transitions. [2022-12-13 13:14:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 13:14:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,642 INFO L225 Difference]: With dead ends: 289 [2022-12-13 13:14:58,642 INFO L226 Difference]: Without dead ends: 287 [2022-12-13 13:14:58,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,643 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 152 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-12-13 13:14:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2022-12-13 13:14:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2022-12-13 13:14:58,651 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2022-12-13 13:14:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,651 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2022-12-13 13:14:58,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2022-12-13 13:14:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:14:58,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:14:58,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2022-12-13 13:14:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344539258] [2022-12-13 13:14:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344539258] [2022-12-13 13:14:58,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344539258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754701280] [2022-12-13 13:14:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,672 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,686 INFO L93 Difference]: Finished difference Result 421 states and 713 transitions. [2022-12-13 13:14:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 13:14:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,688 INFO L225 Difference]: With dead ends: 421 [2022-12-13 13:14:58,688 INFO L226 Difference]: Without dead ends: 419 [2022-12-13 13:14:58,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,689 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-12-13 13:14:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2022-12-13 13:14:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2022-12-13 13:14:58,698 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2022-12-13 13:14:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,698 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2022-12-13 13:14:58,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2022-12-13 13:14:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:14:58,699 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:14:58,700 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2022-12-13 13:14:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33047815] [2022-12-13 13:14:58,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33047815] [2022-12-13 13:14:58,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33047815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948943508] [2022-12-13 13:14:58,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,719 INFO L87 Difference]: Start difference. First operand 321 states and 527 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,737 INFO L93 Difference]: Finished difference Result 757 states and 1249 transitions. [2022-12-13 13:14:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 13:14:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,740 INFO L225 Difference]: With dead ends: 757 [2022-12-13 13:14:58,740 INFO L226 Difference]: Without dead ends: 443 [2022-12-13 13:14:58,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,741 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-12-13 13:14:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2022-12-13 13:14:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2022-12-13 13:14:58,752 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2022-12-13 13:14:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,752 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2022-12-13 13:14:58,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2022-12-13 13:14:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:14:58,753 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:14:58,753 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2022-12-13 13:14:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896661398] [2022-12-13 13:14:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896661398] [2022-12-13 13:14:58,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896661398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929719759] [2022-12-13 13:14:58,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,772 INFO L87 Difference]: Start difference. First operand 441 states and 715 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,788 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2022-12-13 13:14:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 13:14:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,791 INFO L225 Difference]: With dead ends: 669 [2022-12-13 13:14:58,792 INFO L226 Difference]: Without dead ends: 455 [2022-12-13 13:14:58,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,792 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-12-13 13:14:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-12-13 13:14:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2022-12-13 13:14:58,803 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2022-12-13 13:14:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,803 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2022-12-13 13:14:58,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2022-12-13 13:14:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:14:58,804 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:14:58,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2022-12-13 13:14:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876019675] [2022-12-13 13:14:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876019675] [2022-12-13 13:14:58,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876019675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344813515] [2022-12-13 13:14:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,822 INFO L87 Difference]: Start difference. First operand 453 states and 723 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,841 INFO L93 Difference]: Finished difference Result 809 states and 1309 transitions. [2022-12-13 13:14:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 13:14:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,844 INFO L225 Difference]: With dead ends: 809 [2022-12-13 13:14:58,844 INFO L226 Difference]: Without dead ends: 807 [2022-12-13 13:14:58,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,844 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-12-13 13:14:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2022-12-13 13:14:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2022-12-13 13:14:58,862 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2022-12-13 13:14:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,863 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2022-12-13 13:14:58,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2022-12-13 13:14:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:14:58,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:14:58,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2022-12-13 13:14:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029877934] [2022-12-13 13:14:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029877934] [2022-12-13 13:14:58,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029877934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63083262] [2022-12-13 13:14:58,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,883 INFO L87 Difference]: Start difference. First operand 645 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,912 INFO L93 Difference]: Finished difference Result 1497 states and 2333 transitions. [2022-12-13 13:14:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 13:14:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,916 INFO L225 Difference]: With dead ends: 1497 [2022-12-13 13:14:58,916 INFO L226 Difference]: Without dead ends: 871 [2022-12-13 13:14:58,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,917 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-12-13 13:14:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2022-12-13 13:14:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2022-12-13 13:14:58,938 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2022-12-13 13:14:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:58,938 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2022-12-13 13:14:58,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2022-12-13 13:14:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 13:14:58,939 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:58,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:58,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:14:58,939 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2022-12-13 13:14:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:58,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783547972] [2022-12-13 13:14:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:58,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783547972] [2022-12-13 13:14:58,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783547972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:58,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:58,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480859141] [2022-12-13 13:14:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:58,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,956 INFO L87 Difference]: Start difference. First operand 869 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:58,978 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2022-12-13 13:14:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:58,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-13 13:14:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:58,983 INFO L225 Difference]: With dead ends: 1305 [2022-12-13 13:14:58,983 INFO L226 Difference]: Without dead ends: 887 [2022-12-13 13:14:58,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:58,984 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:58,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-12-13 13:14:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2022-12-13 13:14:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2022-12-13 13:14:59,005 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2022-12-13 13:14:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:59,005 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2022-12-13 13:14:59,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2022-12-13 13:14:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 13:14:59,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:59,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:59,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:14:59,006 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:59,007 INFO L85 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2022-12-13 13:14:59,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:59,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537731792] [2022-12-13 13:14:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:59,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:59,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537731792] [2022-12-13 13:14:59,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537731792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:59,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:59,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862878297] [2022-12-13 13:14:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:59,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:59,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,023 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:59,053 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2022-12-13 13:14:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:59,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-13 13:14:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:59,062 INFO L225 Difference]: With dead ends: 1545 [2022-12-13 13:14:59,063 INFO L226 Difference]: Without dead ends: 1543 [2022-12-13 13:14:59,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,064 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:59,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-12-13 13:14:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2022-12-13 13:14:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2022-12-13 13:14:59,112 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2022-12-13 13:14:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:59,112 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2022-12-13 13:14:59,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2022-12-13 13:14:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 13:14:59,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:59,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:59,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:14:59,115 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:59,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2022-12-13 13:14:59,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:59,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745705862] [2022-12-13 13:14:59,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:59,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:59,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:59,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745705862] [2022-12-13 13:14:59,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745705862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:59,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:59,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648256215] [2022-12-13 13:14:59,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:59,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:59,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:59,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,137 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:59,168 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2022-12-13 13:14:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-13 13:14:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:59,172 INFO L225 Difference]: With dead ends: 2953 [2022-12-13 13:14:59,172 INFO L226 Difference]: Without dead ends: 1703 [2022-12-13 13:14:59,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,173 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:59,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-12-13 13:14:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2022-12-13 13:14:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2022-12-13 13:14:59,217 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2022-12-13 13:14:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:59,218 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2022-12-13 13:14:59,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2022-12-13 13:14:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:14:59,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:59,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:59,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:14:59,219 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:59,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2022-12-13 13:14:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:59,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244443724] [2022-12-13 13:14:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:59,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:59,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244443724] [2022-12-13 13:14:59,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244443724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:59,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:59,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073131253] [2022-12-13 13:14:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:59,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:59,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:59,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,234 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:59,261 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2022-12-13 13:14:59,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:59,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 13:14:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:59,267 INFO L225 Difference]: With dead ends: 2553 [2022-12-13 13:14:59,267 INFO L226 Difference]: Without dead ends: 1735 [2022-12-13 13:14:59,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,268 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:59,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-12-13 13:14:59,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2022-12-13 13:14:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2022-12-13 13:14:59,332 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2022-12-13 13:14:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:59,332 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2022-12-13 13:14:59,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2022-12-13 13:14:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:14:59,333 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:59,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:59,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:14:59,334 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:59,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:59,334 INFO L85 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2022-12-13 13:14:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:59,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693082473] [2022-12-13 13:14:59,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:59,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693082473] [2022-12-13 13:14:59,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693082473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:59,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:59,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103997706] [2022-12-13 13:14:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:59,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:59,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:59,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,351 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:59,392 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2022-12-13 13:14:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 13:14:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:59,398 INFO L225 Difference]: With dead ends: 2953 [2022-12-13 13:14:59,398 INFO L226 Difference]: Without dead ends: 2951 [2022-12-13 13:14:59,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,399 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:59,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-12-13 13:14:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2022-12-13 13:14:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2022-12-13 13:14:59,448 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2022-12-13 13:14:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:59,448 INFO L495 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2022-12-13 13:14:59,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2022-12-13 13:14:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:14:59,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:59,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:59,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:14:59,451 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:59,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2022-12-13 13:14:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:59,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505628450] [2022-12-13 13:14:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:59,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:59,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:59,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505628450] [2022-12-13 13:14:59,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505628450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:59,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:59,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852891217] [2022-12-13 13:14:59,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:59,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:59,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:59,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:59,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,473 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:59,543 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2022-12-13 13:14:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:59,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 13:14:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:59,549 INFO L225 Difference]: With dead ends: 5833 [2022-12-13 13:14:59,549 INFO L226 Difference]: Without dead ends: 3335 [2022-12-13 13:14:59,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,551 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:59,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-12-13 13:14:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2022-12-13 13:14:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2022-12-13 13:14:59,630 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2022-12-13 13:14:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:59,630 INFO L495 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2022-12-13 13:14:59,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2022-12-13 13:14:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 13:14:59,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:59,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:59,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:14:59,632 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2022-12-13 13:14:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:59,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780599307] [2022-12-13 13:14:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:59,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:59,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780599307] [2022-12-13 13:14:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780599307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:59,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:59,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651098173] [2022-12-13 13:14:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:59,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,648 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:59,713 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2022-12-13 13:14:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:59,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 13:14:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:59,720 INFO L225 Difference]: With dead ends: 5001 [2022-12-13 13:14:59,720 INFO L226 Difference]: Without dead ends: 3399 [2022-12-13 13:14:59,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,722 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:59,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-12-13 13:14:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2022-12-13 13:14:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2022-12-13 13:14:59,805 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2022-12-13 13:14:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:14:59,805 INFO L495 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2022-12-13 13:14:59,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2022-12-13 13:14:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 13:14:59,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:14:59,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:59,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:14:59,808 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:14:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2022-12-13 13:14:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:59,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495646419] [2022-12-13 13:14:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:59,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495646419] [2022-12-13 13:14:59,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495646419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:59,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:59,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:14:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076004619] [2022-12-13 13:14:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:59,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,824 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:14:59,920 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2022-12-13 13:14:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 13:14:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:14:59,930 INFO L225 Difference]: With dead ends: 5641 [2022-12-13 13:14:59,930 INFO L226 Difference]: Without dead ends: 5639 [2022-12-13 13:14:59,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:59,931 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:14:59,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:14:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-12-13 13:15:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2022-12-13 13:15:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2022-12-13 13:15:00,020 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2022-12-13 13:15:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:15:00,021 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2022-12-13 13:15:00,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2022-12-13 13:15:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 13:15:00,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:15:00,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:00,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:15:00,025 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:15:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2022-12-13 13:15:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:00,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430433794] [2022-12-13 13:15:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:00,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:00,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430433794] [2022-12-13 13:15:00,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430433794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:15:00,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:15:00,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:15:00,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669882965] [2022-12-13 13:15:00,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:15:00,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:15:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:15:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:00,040 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:15:00,159 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2022-12-13 13:15:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:15:00,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 13:15:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:15:00,167 INFO L225 Difference]: With dead ends: 11529 [2022-12-13 13:15:00,167 INFO L226 Difference]: Without dead ends: 6535 [2022-12-13 13:15:00,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:00,171 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:15:00,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:15:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-12-13 13:15:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2022-12-13 13:15:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2022-12-13 13:15:00,310 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2022-12-13 13:15:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:15:00,310 INFO L495 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2022-12-13 13:15:00,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2022-12-13 13:15:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 13:15:00,314 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:15:00,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:00,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:15:00,314 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:15:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2022-12-13 13:15:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:00,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133102884] [2022-12-13 13:15:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:00,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:00,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:00,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133102884] [2022-12-13 13:15:00,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133102884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:15:00,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:15:00,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:15:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487995714] [2022-12-13 13:15:00,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:15:00,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:15:00,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:15:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:00,329 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:15:00,436 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2022-12-13 13:15:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:15:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 13:15:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:15:00,461 INFO L225 Difference]: With dead ends: 9801 [2022-12-13 13:15:00,461 INFO L226 Difference]: Without dead ends: 6663 [2022-12-13 13:15:00,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:00,464 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:15:00,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:15:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2022-12-13 13:15:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2022-12-13 13:15:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2022-12-13 13:15:00,621 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2022-12-13 13:15:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:15:00,621 INFO L495 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2022-12-13 13:15:00,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2022-12-13 13:15:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 13:15:00,626 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:15:00,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:00,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:15:00,626 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:15:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2022-12-13 13:15:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:00,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611747255] [2022-12-13 13:15:00,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:00,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:00,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611747255] [2022-12-13 13:15:00,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611747255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:15:00,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:15:00,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:15:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310137205] [2022-12-13 13:15:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:15:00,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:15:00,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:00,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:15:00,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:00,642 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:15:00,817 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2022-12-13 13:15:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:15:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 13:15:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:15:00,828 INFO L225 Difference]: With dead ends: 10759 [2022-12-13 13:15:00,828 INFO L226 Difference]: Without dead ends: 10757 [2022-12-13 13:15:00,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:00,830 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:15:00,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:15:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2022-12-13 13:15:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2022-12-13 13:15:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2022-12-13 13:15:01,018 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2022-12-13 13:15:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:15:01,018 INFO L495 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2022-12-13 13:15:01,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2022-12-13 13:15:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 13:15:01,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:15:01,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:01,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:15:01,027 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:15:01,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2022-12-13 13:15:01,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:01,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373893140] [2022-12-13 13:15:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:01,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373893140] [2022-12-13 13:15:01,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373893140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:15:01,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:15:01,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:15:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574646660] [2022-12-13 13:15:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:15:01,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:15:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:15:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:01,041 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:15:01,306 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2022-12-13 13:15:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:15:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 13:15:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:15:01,307 INFO L225 Difference]: With dead ends: 22789 [2022-12-13 13:15:01,307 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 13:15:01,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:15:01,318 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:15:01,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:15:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 13:15:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 13:15:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 13:15:01,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-12-13 13:15:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:15:01,319 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 13:15:01,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 13:15:01,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 13:15:01,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 13:15:01,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:15:01,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 6 151) the Hoare annotation is: true [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,331 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L902 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2022-12-13 13:15:01,332 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L902 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 7 151) the Hoare annotation is: false [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-12-13 13:15:01,333 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2022-12-13 13:15:01,336 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:01,337 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:15:01,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:15:01 BoogieIcfgContainer [2022-12-13 13:15:01,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:15:01,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:15:01,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:15:01,344 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:15:01,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:14:57" (3/4) ... [2022-12-13 13:15:01,347 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 13:15:01,354 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 13:15:01,355 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 13:15:01,355 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 13:15:01,355 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 13:15:01,383 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:15:01,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:15:01,383 INFO L158 Benchmark]: Toolchain (without parser) took 4078.54ms. Allocated memory was 172.0MB in the beginning and 383.8MB in the end (delta: 211.8MB). Free memory was 134.0MB in the beginning and 201.5MB in the end (delta: -67.5MB). Peak memory consumption was 147.0MB. Max. memory is 16.1GB. [2022-12-13 13:15:01,383 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:15:01,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.61ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 123.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:15:01,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.97ms. Allocated memory is still 172.0MB. Free memory was 123.0MB in the beginning and 121.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:15:01,384 INFO L158 Benchmark]: Boogie Preprocessor took 21.32ms. Allocated memory is still 172.0MB. Free memory was 121.4MB in the beginning and 120.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:15:01,384 INFO L158 Benchmark]: RCFGBuilder took 281.70ms. Allocated memory is still 172.0MB. Free memory was 120.2MB in the beginning and 106.2MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 13:15:01,384 INFO L158 Benchmark]: TraceAbstraction took 3520.00ms. Allocated memory was 172.0MB in the beginning and 383.8MB in the end (delta: 211.8MB). Free memory was 105.5MB in the beginning and 204.6MB in the end (delta: -99.2MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2022-12-13 13:15:01,385 INFO L158 Benchmark]: Witness Printer took 39.16ms. Allocated memory is still 383.8MB. Free memory was 204.6MB in the beginning and 201.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:15:01,385 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.61ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 123.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.97ms. Allocated memory is still 172.0MB. Free memory was 123.0MB in the beginning and 121.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.32ms. Allocated memory is still 172.0MB. Free memory was 121.4MB in the beginning and 120.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 281.70ms. Allocated memory is still 172.0MB. Free memory was 120.2MB in the beginning and 106.2MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3520.00ms. Allocated memory was 172.0MB in the beginning and 383.8MB in the end (delta: 211.8MB). Free memory was 105.5MB in the beginning and 204.6MB in the end (delta: -99.2MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. * Witness Printer took 39.16ms. Allocated memory is still 383.8MB. Free memory was 204.6MB in the beginning and 201.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 922 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 922 mSDsluCounter, 3098 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1866 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 1011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-13 13:15:01,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e9b3cc7-3d33-4683-9e38-d891e6284d7d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE