./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a --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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- 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-b5237d8 [2022-11-21 09:10:13,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:10:13,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:10:13,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:10:13,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:10:13,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:10:13,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:10:13,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:10:13,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:10:13,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:10:13,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:10:13,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:10:13,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:10:13,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:10:13,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:10:13,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:10:13,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:10:13,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:10:13,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:10:13,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:10:13,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:10:13,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:10:13,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:10:13,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:10:13,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:10:13,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:10:13,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:10:13,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:10:13,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:10:13,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:10:13,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:10:13,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:10:13,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:10:13,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:10:13,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:10:13,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:10:13,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:10:13,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:10:13,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:10:13,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:10:13,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:10:13,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 09:10:13,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:10:13,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:10:13,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:10:13,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:10:13,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:10:13,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:10:13,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:10:13,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:10:13,451 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:10:13,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:10:13,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:10:13,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:10:13,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:10:13,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:10:13,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 09:10:13,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:10:13,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 09:10:13,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:10:13,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 09:10:13,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:10:13,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 09:10:13,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:10:13,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:10:13,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:10:13,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:10:13,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:10:13,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:10:13,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 09:10:13,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 09:10:13,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 09:10:13,458 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 09:10:13,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 09:10:13,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 09:10:13,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/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_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2022-11-21 09:10:13,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:10:13,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:10:13,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:10:13,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:10:13,754 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:10:13,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/locks/test_locks_8.c [2022-11-21 09:10:16,701 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:10:16,884 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:10:16,885 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/sv-benchmarks/c/locks/test_locks_8.c [2022-11-21 09:10:16,892 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/data/ac55a3a81/0a72949759ef4f3c83b9b27e35c122b5/FLAGb1b658fd4 [2022-11-21 09:10:16,906 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/data/ac55a3a81/0a72949759ef4f3c83b9b27e35c122b5 [2022-11-21 09:10:16,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:10:16,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:10:16,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:10:16,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:10:16,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:10:16,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:10:16" (1/1) ... [2022-11-21 09:10:16,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1824e4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:16, skipping insertion in model container [2022-11-21 09:10:16,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:10:16" (1/1) ... [2022-11-21 09:10:16,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:10:16,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:10:17,128 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_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-11-21 09:10:17,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:10:17,144 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:10:17,166 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_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2022-11-21 09:10:17,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:10:17,196 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:10:17,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17 WrapperNode [2022-11-21 09:10:17,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:10:17,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:10:17,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:10:17,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:10:17,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,231 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-11-21 09:10:17,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:10:17,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:10:17,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:10:17,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:10:17,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,252 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:10:17,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:10:17,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:10:17,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:10:17,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (1/1) ... [2022-11-21 09:10:17,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:10:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:10:17,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:10:17,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:10:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:10:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:10:17,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:10:17,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 09:10:17,413 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:10:17,414 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:10:17,610 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:10:17,616 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:10:17,616 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 09:10:17,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:10:17 BoogieIcfgContainer [2022-11-21 09:10:17,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:10:17,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:10:17,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:10:17,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:10:17,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:10:16" (1/3) ... [2022-11-21 09:10:17,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da1c6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:10:17, skipping insertion in model container [2022-11-21 09:10:17,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:10:17" (2/3) ... [2022-11-21 09:10:17,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da1c6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:10:17, skipping insertion in model container [2022-11-21 09:10:17,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:10:17" (3/3) ... [2022-11-21 09:10:17,628 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-11-21 09:10:17,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:10:17,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 09:10:17,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:10:17,729 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;@62bfe481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:10:17,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 09:10:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 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-11-21 09:10:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:10:17,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:17,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:17,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2022-11-21 09:10:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:17,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400967004] [2022-11-21 09:10:17,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:18,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:18,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400967004] [2022-11-21 09:10:18,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400967004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:18,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:18,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322037082] [2022-11-21 09:10:18,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:18,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:18,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:18,113 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 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.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-21 09:10:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:18,155 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2022-11-21 09:10:18,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:18,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-21 09:10:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:18,167 INFO L225 Difference]: With dead ends: 71 [2022-11-21 09:10:18,168 INFO L226 Difference]: Without dead ends: 57 [2022-11-21 09:10:18,170 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-11-21 09:10:18,174 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 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-11-21 09:10:18,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-21 09:10:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2022-11-21 09:10:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 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-11-21 09:10:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2022-11-21 09:10:18,212 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2022-11-21 09:10:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:18,213 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2022-11-21 09:10:18,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-21 09:10:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2022-11-21 09:10:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:10:18,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:18,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:18,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 09:10:18,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2022-11-21 09:10:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627582514] [2022-11-21 09:10:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:18,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:18,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627582514] [2022-11-21 09:10:18,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627582514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:18,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:18,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177201459] [2022-11-21 09:10:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:18,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:18,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:18,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:18,313 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-21 09:10:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:18,357 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2022-11-21 09:10:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:18,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-21 09:10:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:18,359 INFO L225 Difference]: With dead ends: 94 [2022-11-21 09:10:18,359 INFO L226 Difference]: Without dead ends: 57 [2022-11-21 09:10:18,360 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-11-21 09:10:18,361 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 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-11-21 09:10:18,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-21 09:10:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-11-21 09:10:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 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-11-21 09:10:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-11-21 09:10:18,369 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2022-11-21 09:10:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:18,370 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-11-21 09:10:18,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-21 09:10:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-11-21 09:10:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:10:18,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:18,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:18,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 09:10:18,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2022-11-21 09:10:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:18,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500350999] [2022-11-21 09:10:18,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:18,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:18,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500350999] [2022-11-21 09:10:18,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500350999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:18,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:18,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:18,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898705753] [2022-11-21 09:10:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:18,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:18,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:18,484 INFO L87 Difference]: Start difference. First operand 55 states and 98 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-11-21 09:10:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:18,504 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2022-11-21 09:10:18,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:18,504 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-11-21 09:10:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:18,506 INFO L225 Difference]: With dead ends: 87 [2022-11-21 09:10:18,506 INFO L226 Difference]: Without dead ends: 60 [2022-11-21 09:10:18,506 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-11-21 09:10:18,508 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 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-11-21 09:10:18,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-21 09:10:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-11-21 09:10:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 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-11-21 09:10:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2022-11-21 09:10:18,517 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2022-11-21 09:10:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:18,517 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2022-11-21 09:10:18,517 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-11-21 09:10:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2022-11-21 09:10:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:10:18,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:18,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:18,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 09:10:18,519 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2022-11-21 09:10:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:18,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434983303] [2022-11-21 09:10:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:18,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:18,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434983303] [2022-11-21 09:10:18,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434983303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:18,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:18,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148120981] [2022-11-21 09:10:18,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:18,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:18,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:18,569 INFO L87 Difference]: Start difference. First operand 58 states and 100 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-11-21 09:10:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:18,589 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2022-11-21 09:10:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:18,590 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-11-21 09:10:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:18,591 INFO L225 Difference]: With dead ends: 109 [2022-11-21 09:10:18,592 INFO L226 Difference]: Without dead ends: 107 [2022-11-21 09:10:18,592 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-11-21 09:10:18,594 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 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-11-21 09:10:18,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-21 09:10:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2022-11-21 09:10:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 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-11-21 09:10:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2022-11-21 09:10:18,604 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2022-11-21 09:10:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:18,605 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2022-11-21 09:10:18,605 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-11-21 09:10:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2022-11-21 09:10:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:10:18,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:18,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:18,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 09:10:18,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2022-11-21 09:10:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:18,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130133843] [2022-11-21 09:10:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:18,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130133843] [2022-11-21 09:10:18,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130133843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:18,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:18,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:18,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133242399] [2022-11-21 09:10:18,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:18,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:18,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:18,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:18,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:18,685 INFO L87 Difference]: Start difference. First operand 77 states and 133 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-11-21 09:10:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:18,709 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2022-11-21 09:10:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:18,710 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-11-21 09:10:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:18,712 INFO L225 Difference]: With dead ends: 181 [2022-11-21 09:10:18,712 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 09:10:18,712 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-11-21 09:10:18,714 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 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-11-21 09:10:18,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 09:10:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-11-21 09:10:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 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-11-21 09:10:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2022-11-21 09:10:18,728 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2022-11-21 09:10:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:18,729 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2022-11-21 09:10:18,729 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-11-21 09:10:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2022-11-21 09:10:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 09:10:18,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:18,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:18,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 09:10:18,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2022-11-21 09:10:18,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:18,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745776081] [2022-11-21 09:10:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:18,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:18,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745776081] [2022-11-21 09:10:18,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745776081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:18,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:18,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161769437] [2022-11-21 09:10:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:18,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:18,773 INFO L87 Difference]: Start difference. First operand 107 states and 183 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-11-21 09:10:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:18,792 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2022-11-21 09:10:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:18,793 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-11-21 09:10:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:18,794 INFO L225 Difference]: With dead ends: 162 [2022-11-21 09:10:18,794 INFO L226 Difference]: Without dead ends: 111 [2022-11-21 09:10:18,794 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-11-21 09:10:18,796 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 39 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 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-11-21 09:10:18,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-21 09:10:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2022-11-21 09:10:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 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-11-21 09:10:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2022-11-21 09:10:18,808 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2022-11-21 09:10:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:18,809 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2022-11-21 09:10:18,809 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-11-21 09:10:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2022-11-21 09:10:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 09:10:18,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:18,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:18,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 09:10:18,811 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:18,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:18,812 INFO L85 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2022-11-21 09:10:18,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:18,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757559853] [2022-11-21 09:10:18,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:18,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:18,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757559853] [2022-11-21 09:10:18,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757559853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:18,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:18,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720938142] [2022-11-21 09:10:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:18,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:18,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:18,865 INFO L87 Difference]: Start difference. First operand 109 states and 183 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-11-21 09:10:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:18,903 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2022-11-21 09:10:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:18,904 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-11-21 09:10:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:18,906 INFO L225 Difference]: With dead ends: 309 [2022-11-21 09:10:18,906 INFO L226 Difference]: Without dead ends: 207 [2022-11-21 09:10:18,906 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-11-21 09:10:18,908 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 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-11-21 09:10:18,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-21 09:10:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-11-21 09:10:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 states have internal predecessors, (339), 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-11-21 09:10:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2022-11-21 09:10:18,943 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2022-11-21 09:10:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:18,944 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2022-11-21 09:10:18,948 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-11-21 09:10:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2022-11-21 09:10:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 09:10:18,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:18,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:18,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 09:10:18,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2022-11-21 09:10:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:18,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996099713] [2022-11-21 09:10:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:18,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996099713] [2022-11-21 09:10:18,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996099713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:18,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:18,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117963978] [2022-11-21 09:10:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:18,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:18,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:18,994 INFO L87 Difference]: Start difference. First operand 205 states and 339 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-11-21 09:10:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,011 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2022-11-21 09:10:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,011 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-11-21 09:10:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,013 INFO L225 Difference]: With dead ends: 257 [2022-11-21 09:10:19,013 INFO L226 Difference]: Without dead ends: 255 [2022-11-21 09:10:19,013 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-11-21 09:10:19,014 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 134 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-11-21 09:10:19,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 134 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-21 09:10:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2022-11-21 09:10:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 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-11-21 09:10:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2022-11-21 09:10:19,029 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2022-11-21 09:10:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,029 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2022-11-21 09:10:19,029 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-11-21 09:10:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2022-11-21 09:10:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 09:10:19,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:19,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 09:10:19,031 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2022-11-21 09:10:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087625528] [2022-11-21 09:10:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:19,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087625528] [2022-11-21 09:10:19,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087625528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:19,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:19,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653487041] [2022-11-21 09:10:19,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:19,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:19,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:19,063 INFO L87 Difference]: Start difference. First operand 205 states and 335 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-11-21 09:10:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,081 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2022-11-21 09:10:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,082 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-11-21 09:10:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,084 INFO L225 Difference]: With dead ends: 373 [2022-11-21 09:10:19,084 INFO L226 Difference]: Without dead ends: 371 [2022-11-21 09:10:19,084 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-11-21 09:10:19,085 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 97 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-11-21 09:10:19,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 97 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-21 09:10:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2022-11-21 09:10:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 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-11-21 09:10:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2022-11-21 09:10:19,113 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2022-11-21 09:10:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,114 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2022-11-21 09:10:19,114 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-11-21 09:10:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2022-11-21 09:10:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 09:10:19,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:10:19,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 09:10:19,116 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2022-11-21 09:10:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319041036] [2022-11-21 09:10:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319041036] [2022-11-21 09:10:19,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319041036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:19,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:19,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:19,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515425066] [2022-11-21 09:10:19,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:19,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:19,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:19,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:19,146 INFO L87 Difference]: Start difference. First operand 289 states and 463 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-11-21 09:10:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,166 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2022-11-21 09:10:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,167 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-11-21 09:10:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,168 INFO L225 Difference]: With dead ends: 677 [2022-11-21 09:10:19,169 INFO L226 Difference]: Without dead ends: 395 [2022-11-21 09:10:19,170 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-11-21 09:10:19,171 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 118 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-11-21 09:10:19,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-11-21 09:10:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2022-11-21 09:10:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 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-11-21 09:10:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2022-11-21 09:10:19,189 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2022-11-21 09:10:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,189 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2022-11-21 09:10:19,190 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-11-21 09:10:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2022-11-21 09:10:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 09:10:19,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,192 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-11-21 09:10:19,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 09:10:19,192 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2022-11-21 09:10:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086635422] [2022-11-21 09:10:19,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:19,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:19,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086635422] [2022-11-21 09:10:19,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086635422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:19,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:19,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855159137] [2022-11-21 09:10:19,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:19,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:19,237 INFO L87 Difference]: Start difference. First operand 393 states and 619 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-11-21 09:10:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,271 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2022-11-21 09:10:19,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,274 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-11-21 09:10:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,276 INFO L225 Difference]: With dead ends: 597 [2022-11-21 09:10:19,276 INFO L226 Difference]: Without dead ends: 407 [2022-11-21 09:10:19,277 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-11-21 09:10:19,278 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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-11-21 09:10:19,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-21 09:10:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2022-11-21 09:10:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 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-11-21 09:10:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2022-11-21 09:10:19,308 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2022-11-21 09:10:19,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,308 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2022-11-21 09:10:19,308 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-11-21 09:10:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2022-11-21 09:10:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 09:10:19,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,317 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-11-21 09:10:19,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 09:10:19,317 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2022-11-21 09:10:19,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619239463] [2022-11-21 09:10:19,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:19,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:19,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619239463] [2022-11-21 09:10:19,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619239463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:19,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:19,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:19,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481964216] [2022-11-21 09:10:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:19,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:19,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:19,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:19,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:19,367 INFO L87 Difference]: Start difference. First operand 405 states and 627 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-11-21 09:10:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,410 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2022-11-21 09:10:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,410 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-11-21 09:10:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,413 INFO L225 Difference]: With dead ends: 713 [2022-11-21 09:10:19,413 INFO L226 Difference]: Without dead ends: 711 [2022-11-21 09:10:19,414 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-11-21 09:10:19,414 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 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-11-21 09:10:19,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-21 09:10:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2022-11-21 09:10:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 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-11-21 09:10:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2022-11-21 09:10:19,436 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2022-11-21 09:10:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,438 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2022-11-21 09:10:19,438 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-11-21 09:10:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2022-11-21 09:10:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 09:10:19,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,440 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-11-21 09:10:19,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 09:10:19,440 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2022-11-21 09:10:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245667397] [2022-11-21 09:10:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:19,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245667397] [2022-11-21 09:10:19,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245667397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:19,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:19,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783221013] [2022-11-21 09:10:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:19,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:19,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:19,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:19,502 INFO L87 Difference]: Start difference. First operand 581 states and 875 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-11-21 09:10:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,541 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2022-11-21 09:10:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,542 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-11-21 09:10:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,544 INFO L225 Difference]: With dead ends: 1337 [2022-11-21 09:10:19,545 INFO L226 Difference]: Without dead ends: 775 [2022-11-21 09:10:19,545 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-11-21 09:10:19,550 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 119 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-11-21 09:10:19,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-11-21 09:10:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2022-11-21 09:10:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 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-11-21 09:10:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2022-11-21 09:10:19,582 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2022-11-21 09:10:19,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,582 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2022-11-21 09:10:19,582 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-11-21 09:10:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2022-11-21 09:10:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 09:10:19,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,584 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-11-21 09:10:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 09:10:19,584 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2022-11-21 09:10:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010825219] [2022-11-21 09:10:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:19,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010825219] [2022-11-21 09:10:19,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010825219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:19,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:19,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753438703] [2022-11-21 09:10:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:19,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:19,611 INFO L87 Difference]: Start difference. First operand 773 states and 1139 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-11-21 09:10:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,637 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2022-11-21 09:10:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,638 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-11-21 09:10:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,640 INFO L225 Difference]: With dead ends: 1161 [2022-11-21 09:10:19,641 INFO L226 Difference]: Without dead ends: 791 [2022-11-21 09:10:19,641 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-11-21 09:10:19,642 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 112 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-11-21 09:10:19,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-21 09:10:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2022-11-21 09:10:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 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-11-21 09:10:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2022-11-21 09:10:19,689 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2022-11-21 09:10:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,690 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2022-11-21 09:10:19,690 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-11-21 09:10:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2022-11-21 09:10:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 09:10:19,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,694 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-11-21 09:10:19,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 09:10:19,694 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2022-11-21 09:10:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566506315] [2022-11-21 09:10:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:19,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:19,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566506315] [2022-11-21 09:10:19,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566506315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:19,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:19,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:19,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762135201] [2022-11-21 09:10:19,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:19,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:19,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:19,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:19,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:19,737 INFO L87 Difference]: Start difference. First operand 789 states and 1139 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-11-21 09:10:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,784 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2022-11-21 09:10:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,785 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-11-21 09:10:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,790 INFO L225 Difference]: With dead ends: 1353 [2022-11-21 09:10:19,790 INFO L226 Difference]: Without dead ends: 1351 [2022-11-21 09:10:19,791 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-11-21 09:10:19,791 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 23 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 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-11-21 09:10:19,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-11-21 09:10:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2022-11-21 09:10:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 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-11-21 09:10:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2022-11-21 09:10:19,840 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2022-11-21 09:10:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,840 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2022-11-21 09:10:19,841 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-11-21 09:10:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2022-11-21 09:10:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 09:10:19,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,843 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-11-21 09:10:19,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 09:10:19,844 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2022-11-21 09:10:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656926145] [2022-11-21 09:10:19,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:19,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:19,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656926145] [2022-11-21 09:10:19,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656926145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:19,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:19,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:19,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18282013] [2022-11-21 09:10:19,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:19,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:19,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:19,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:19,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:19,871 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 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-11-21 09:10:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:19,918 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2022-11-21 09:10:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:19,919 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-11-21 09:10:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:19,923 INFO L225 Difference]: With dead ends: 2633 [2022-11-21 09:10:19,924 INFO L226 Difference]: Without dead ends: 1511 [2022-11-21 09:10:19,925 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-11-21 09:10:19,926 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 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-11-21 09:10:19,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-11-21 09:10:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2022-11-21 09:10:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 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-11-21 09:10:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2022-11-21 09:10:19,984 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2022-11-21 09:10:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:19,985 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2022-11-21 09:10:19,985 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-11-21 09:10:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2022-11-21 09:10:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 09:10:19,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:19,987 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-11-21 09:10:19,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 09:10:19,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2022-11-21 09:10:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:19,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517308789] [2022-11-21 09:10:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:20,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517308789] [2022-11-21 09:10:20,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517308789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:20,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:20,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223095453] [2022-11-21 09:10:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:20,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:20,013 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 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-11-21 09:10:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:20,056 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2022-11-21 09:10:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:20,056 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-11-21 09:10:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:20,061 INFO L225 Difference]: With dead ends: 2265 [2022-11-21 09:10:20,062 INFO L226 Difference]: Without dead ends: 1543 [2022-11-21 09:10:20,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-11-21 09:10:20,063 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 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-11-21 09:10:20,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-11-21 09:10:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2022-11-21 09:10:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 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-11-21 09:10:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2022-11-21 09:10:20,133 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2022-11-21 09:10:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:20,134 INFO L495 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2022-11-21 09:10:20,134 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-11-21 09:10:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2022-11-21 09:10:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 09:10:20,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:20,136 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-11-21 09:10:20,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 09:10:20,136 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2022-11-21 09:10:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:20,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332257292] [2022-11-21 09:10:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:20,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332257292] [2022-11-21 09:10:20,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332257292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:20,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:20,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555187951] [2022-11-21 09:10:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:20,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:20,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:20,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:20,160 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 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-11-21 09:10:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:20,230 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2022-11-21 09:10:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:20,231 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-11-21 09:10:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:20,238 INFO L225 Difference]: With dead ends: 2569 [2022-11-21 09:10:20,238 INFO L226 Difference]: Without dead ends: 2567 [2022-11-21 09:10:20,239 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-11-21 09:10:20,240 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 91 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-11-21 09:10:20,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2022-11-21 09:10:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2022-11-21 09:10:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 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-11-21 09:10:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2022-11-21 09:10:20,313 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2022-11-21 09:10:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:20,314 INFO L495 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2022-11-21 09:10:20,314 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-11-21 09:10:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2022-11-21 09:10:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 09:10:20,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:20,317 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-11-21 09:10:20,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 09:10:20,317 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2022-11-21 09:10:20,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:20,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990422625] [2022-11-21 09:10:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:20,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:20,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990422625] [2022-11-21 09:10:20,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990422625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:20,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:20,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209208653] [2022-11-21 09:10:20,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:20,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:20,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:20,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:20,340 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 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-11-21 09:10:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:20,419 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2022-11-21 09:10:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:20,420 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-11-21 09:10:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:20,428 INFO L225 Difference]: With dead ends: 5193 [2022-11-21 09:10:20,429 INFO L226 Difference]: Without dead ends: 2951 [2022-11-21 09:10:20,431 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-11-21 09:10:20,432 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 121 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-11-21 09:10:20,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-11-21 09:10:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2022-11-21 09:10:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 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-11-21 09:10:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2022-11-21 09:10:20,569 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2022-11-21 09:10:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:20,570 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2022-11-21 09:10:20,570 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-11-21 09:10:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2022-11-21 09:10:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 09:10:20,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:20,573 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-11-21 09:10:20,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 09:10:20,574 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:20,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2022-11-21 09:10:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:20,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295195778] [2022-11-21 09:10:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:20,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:20,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295195778] [2022-11-21 09:10:20,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295195778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:20,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:20,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099948526] [2022-11-21 09:10:20,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:20,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:20,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:20,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:20,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:20,595 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 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-11-21 09:10:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:20,667 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2022-11-21 09:10:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:20,668 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-11-21 09:10:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:20,677 INFO L225 Difference]: With dead ends: 4425 [2022-11-21 09:10:20,677 INFO L226 Difference]: Without dead ends: 3015 [2022-11-21 09:10:20,679 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-11-21 09:10:20,680 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 104 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-11-21 09:10:20,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2022-11-21 09:10:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2022-11-21 09:10:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 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-11-21 09:10:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2022-11-21 09:10:20,793 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2022-11-21 09:10:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:20,793 INFO L495 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2022-11-21 09:10:20,794 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-11-21 09:10:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2022-11-21 09:10:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 09:10:20,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:20,797 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-11-21 09:10:20,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 09:10:20,798 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2022-11-21 09:10:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:20,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398470855] [2022-11-21 09:10:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:20,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:20,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-11-21 09:10:20,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:20,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398470855] [2022-11-21 09:10:20,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398470855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:20,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:20,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:20,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563656203] [2022-11-21 09:10:20,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:20,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:20,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:20,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:20,823 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 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-11-21 09:10:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:20,967 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2022-11-21 09:10:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:20,968 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-11-21 09:10:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:20,981 INFO L225 Difference]: With dead ends: 4871 [2022-11-21 09:10:20,982 INFO L226 Difference]: Without dead ends: 4869 [2022-11-21 09:10:20,983 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-11-21 09:10:20,984 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 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-11-21 09:10:20,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2022-11-21 09:10:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2022-11-21 09:10:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 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-11-21 09:10:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2022-11-21 09:10:21,126 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2022-11-21 09:10:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:21,126 INFO L495 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2022-11-21 09:10:21,127 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-11-21 09:10:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2022-11-21 09:10:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 09:10:21,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:10:21,132 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-11-21 09:10:21,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 09:10:21,133 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:10:21,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2022-11-21 09:10:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:21,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205279044] [2022-11-21 09:10:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:21,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205279044] [2022-11-21 09:10:21,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205279044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:21,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:21,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556651648] [2022-11-21 09:10:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:21,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:21,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:21,154 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 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-11-21 09:10:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:10:21,367 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2022-11-21 09:10:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:21,368 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-11-21 09:10:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:10:21,368 INFO L225 Difference]: With dead ends: 10245 [2022-11-21 09:10:21,368 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 09:10:21,375 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-11-21 09:10:21,375 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 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-11-21 09:10:21,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:10:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 09:10:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 09:10:21,377 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-11-21 09:10:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 09:10:21,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-11-21 09:10:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:10:21,377 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 09:10:21,378 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-11-21 09:10:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 09:10:21,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 09:10:21,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 09:10:21,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 09:10:21,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 09:10:21,393 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-11-21 09:10:21,393 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-11-21 09:10:21,393 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,394 INFO L902 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-11-21 09:10:21,394 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 09:10:21,394 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 09:10:21,394 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,394 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,394 INFO L902 garLoopResultBuilder]: At program point L136(lines 6 137) the Hoare annotation is: true [2022-11-21 09:10:21,395 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-11-21 09:10:21,395 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-11-21 09:10:21,395 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,395 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-11-21 09:10:21,395 INFO L895 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-11-21 09:10:21,395 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,396 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,396 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-11-21 09:10:21,396 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,396 INFO L899 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,396 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-11-21 09:10:21,396 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 09:10:21,397 INFO L899 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-11-21 09:10:21,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-11-21 09:10:21,397 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,397 INFO L899 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,397 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,397 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,398 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 09:10:21,398 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-11-21 09:10:21,398 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,398 INFO L899 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-11-21 09:10:21,398 INFO L902 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-11-21 09:10:21,398 INFO L899 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,399 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-11-21 09:10:21,402 INFO L444 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] [2022-11-21 09:10:21,404 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 09:10:21,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:10:21 BoogieIcfgContainer [2022-11-21 09:10:21,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 09:10:21,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 09:10:21,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 09:10:21,418 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 09:10:21,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:10:17" (3/4) ... [2022-11-21 09:10:21,421 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 09:10:21,431 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-21 09:10:21,431 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-21 09:10:21,432 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 09:10:21,432 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 09:10:21,466 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 09:10:21,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 09:10:21,467 INFO L158 Benchmark]: Toolchain (without parser) took 4557.00ms. Allocated memory was 138.4MB in the beginning and 270.5MB in the end (delta: 132.1MB). Free memory was 76.4MB in the beginning and 161.1MB in the end (delta: -84.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-11-21 09:10:21,468 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 138.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:10:21,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.29ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 76.3MB in the beginning and 153.4MB in the end (delta: -77.2MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-11-21 09:10:21,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 182.5MB. Free memory was 153.4MB in the beginning and 152.5MB in the end (delta: 915.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:10:21,469 INFO L158 Benchmark]: Boogie Preprocessor took 22.77ms. Allocated memory is still 182.5MB. Free memory was 152.5MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:10:21,469 INFO L158 Benchmark]: RCFGBuilder took 362.62ms. Allocated memory is still 182.5MB. Free memory was 150.4MB in the beginning and 137.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 09:10:21,469 INFO L158 Benchmark]: TraceAbstraction took 3795.67ms. Allocated memory was 182.5MB in the beginning and 270.5MB in the end (delta: 88.1MB). Free memory was 136.7MB in the beginning and 164.2MB in the end (delta: -27.6MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2022-11-21 09:10:21,470 INFO L158 Benchmark]: Witness Printer took 49.37ms. Allocated memory is still 270.5MB. Free memory was 164.2MB in the beginning and 161.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:10:21,472 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.24ms. Allocated memory is still 138.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.29ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 76.3MB in the beginning and 153.4MB in the end (delta: -77.2MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 182.5MB. Free memory was 153.4MB in the beginning and 152.5MB in the end (delta: 915.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.77ms. Allocated memory is still 182.5MB. Free memory was 152.5MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.62ms. Allocated memory is still 182.5MB. Free memory was 150.4MB in the beginning and 137.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3795.67ms. Allocated memory was 182.5MB in the beginning and 270.5MB in the end (delta: 88.1MB). Free memory was 136.7MB in the beginning and 164.2MB in the end (delta: -27.6MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 49.37ms. Allocated memory is still 270.5MB. Free memory was 164.2MB in the beginning and 161.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 135]: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 964 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1474 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 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.7s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 09:10:21,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e78f0a9b-8751-4c71-9bb1-ffdb9110c18e/bin/uautomizer-vX5HgA9Q3a/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