./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc --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 c39b660f273ecbdfa60a013e46dad0637949d26902d1f41ae3834ad8e3310564 --- 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-5e519f3 [2022-11-02 19:57:07,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:57:07,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:57:07,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:57:07,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:57:07,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:57:07,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:57:07,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:57:07,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:57:07,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:57:07,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:57:07,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:57:07,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:57:07,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:57:07,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:57:07,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:57:07,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:57:07,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:57:07,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:57:07,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:57:07,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:57:07,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:57:07,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:57:07,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:57:07,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:57:07,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:57:07,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:57:07,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:57:07,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:57:07,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:57:07,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:57:07,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:57:07,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:57:07,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:57:07,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:57:07,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:57:07,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:57:07,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:57:07,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:57:07,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:57:07,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:57:07,403 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 19:57:07,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:57:07,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:57:07,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:57:07,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:57:07,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:57:07,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:57:07,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:57:07,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:57:07,472 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:57:07,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:57:07,473 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:57:07,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:57:07,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:57:07,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:57:07,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 19:57:07,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:57:07,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 19:57:07,476 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:57:07,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 19:57:07,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:57:07,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 19:57:07,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:57:07,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:57:07,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:57:07,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:57:07,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:57:07,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:57:07,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 19:57:07,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:57:07,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:57:07,479 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 19:57:07,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 19:57:07,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 19:57:07,480 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_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/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_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc 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 -> c39b660f273ecbdfa60a013e46dad0637949d26902d1f41ae3834ad8e3310564 [2022-11-02 19:57:07,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:57:07,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:57:07,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:57:07,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:57:07,887 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:57:07,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-11-02 19:57:07,961 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/data/54fe31d8b/82dc16614c854b8bad3f3a16cfae122d/FLAG552c774f5 [2022-11-02 19:57:08,642 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:57:08,643 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-11-02 19:57:08,654 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/data/54fe31d8b/82dc16614c854b8bad3f3a16cfae122d/FLAG552c774f5 [2022-11-02 19:57:08,963 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/data/54fe31d8b/82dc16614c854b8bad3f3a16cfae122d [2022-11-02 19:57:08,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:57:08,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:57:08,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:57:08,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:57:08,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:57:08,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:57:08" (1/1) ... [2022-11-02 19:57:08,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da4819e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:08, skipping insertion in model container [2022-11-02 19:57:08,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:57:08" (1/1) ... [2022-11-02 19:57:08,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:57:09,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:57:09,349 WARN L230 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_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7469,7482] [2022-11-02 19:57:09,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:57:09,440 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:57:09,504 WARN L230 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_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7469,7482] [2022-11-02 19:57:09,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:57:09,552 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:57:09,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09 WrapperNode [2022-11-02 19:57:09,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:57:09,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:57:09,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:57:09,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:57:09,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,617 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 610 [2022-11-02 19:57:09,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:57:09,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:57:09,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:57:09,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:57:09,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,652 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:57:09,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:57:09,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:57:09,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:57:09,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (1/1) ... [2022-11-02 19:57:09,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:57:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:57:09,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:57:09,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5aae64-1ffc-4c64-8cc0-b40fe00d3c64/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:57:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:57:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:57:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:57:09,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:57:09,922 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:57:09,924 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:57:10,798 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:57:10,809 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:57:10,809 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 19:57:10,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:57:10 BoogieIcfgContainer [2022-11-02 19:57:10,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:57:10,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:57:10,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:57:10,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:57:10,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:57:08" (1/3) ... [2022-11-02 19:57:10,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a51786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:57:10, skipping insertion in model container [2022-11-02 19:57:10,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:57:09" (2/3) ... [2022-11-02 19:57:10,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a51786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:57:10, skipping insertion in model container [2022-11-02 19:57:10,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:57:10" (3/3) ... [2022-11-02 19:57:10,824 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-11-02 19:57:10,860 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:57:10,868 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 19:57:10,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:57:10,979 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;@397e1b95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:57:10,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 19:57:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 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-02 19:57:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 19:57:10,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:10,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:10,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash 985312972, now seen corresponding path program 1 times [2022-11-02 19:57:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:11,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951318290] [2022-11-02 19:57:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,625 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-02 19:57:11,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:11,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951318290] [2022-11-02 19:57:11,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951318290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:11,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:11,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:57:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687974394] [2022-11-02 19:57:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:11,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:57:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:11,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:57:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:57:11,689 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 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 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-02 19:57:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:12,044 INFO L93 Difference]: Finished difference Result 517 states and 836 transitions. [2022-11-02 19:57:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:57:12,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2022-11-02 19:57:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:12,070 INFO L225 Difference]: With dead ends: 517 [2022-11-02 19:57:12,070 INFO L226 Difference]: Without dead ends: 438 [2022-11-02 19:57:12,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:12,080 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 913 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:12,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1288 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:57:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-02 19:57:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 256. [2022-11-02 19:57:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 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-02 19:57:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2022-11-02 19:57:12,162 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 50 [2022-11-02 19:57:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:12,163 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2022-11-02 19:57:12,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-02 19:57:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2022-11-02 19:57:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 19:57:12,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:12,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:12,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:57:12,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash -722006169, now seen corresponding path program 1 times [2022-11-02 19:57:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:12,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30447774] [2022-11-02 19:57:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:12,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:12,391 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-02 19:57:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:12,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30447774] [2022-11-02 19:57:12,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30447774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:12,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:12,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:57:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143487652] [2022-11-02 19:57:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:12,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:57:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:57:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:57:12,403 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02 19:57:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:12,548 INFO L93 Difference]: Finished difference Result 628 states and 954 transitions. [2022-11-02 19:57:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:57:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2022-11-02 19:57:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:12,556 INFO L225 Difference]: With dead ends: 628 [2022-11-02 19:57:12,556 INFO L226 Difference]: Without dead ends: 430 [2022-11-02 19:57:12,566 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-02 19:57:12,569 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 158 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:12,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:57:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-02 19:57:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2022-11-02 19:57:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 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-02 19:57:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2022-11-02 19:57:12,631 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 53 [2022-11-02 19:57:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:12,632 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2022-11-02 19:57:12,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02 19:57:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2022-11-02 19:57:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 19:57:12,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:12,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:12,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 19:57:12,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash -695460410, now seen corresponding path program 1 times [2022-11-02 19:57:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:12,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535356446] [2022-11-02 19:57:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:12,768 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-02 19:57:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:12,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535356446] [2022-11-02 19:57:12,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535356446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:12,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:12,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:57:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020891225] [2022-11-02 19:57:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:12,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:57:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:12,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:57:12,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:57:12,772 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02 19:57:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:12,874 INFO L93 Difference]: Finished difference Result 1078 states and 1615 transitions. [2022-11-02 19:57:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:57:12,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2022-11-02 19:57:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:12,890 INFO L225 Difference]: With dead ends: 1078 [2022-11-02 19:57:12,890 INFO L226 Difference]: Without dead ends: 750 [2022-11-02 19:57:12,894 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-02 19:57:12,900 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 157 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:12,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:57:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-11-02 19:57:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2022-11-02 19:57:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 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-02 19:57:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1100 transitions. [2022-11-02 19:57:13,027 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1100 transitions. Word has length 53 [2022-11-02 19:57:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:13,030 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 1100 transitions. [2022-11-02 19:57:13,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02 19:57:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1100 transitions. [2022-11-02 19:57:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 19:57:13,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:13,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:13,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 19:57:13,043 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:13,047 INFO L85 PathProgramCache]: Analyzing trace with hash -272648633, now seen corresponding path program 1 times [2022-11-02 19:57:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:13,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745893704] [2022-11-02 19:57:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:13,163 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-02 19:57:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:13,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745893704] [2022-11-02 19:57:13,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745893704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:13,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:13,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:57:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647435320] [2022-11-02 19:57:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:13,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:57:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:57:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:57:13,167 INFO L87 Difference]: Start difference. First operand 748 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02 19:57:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:13,354 INFO L93 Difference]: Finished difference Result 1859 states and 2747 transitions. [2022-11-02 19:57:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:57:13,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2022-11-02 19:57:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:13,361 INFO L225 Difference]: With dead ends: 1859 [2022-11-02 19:57:13,362 INFO L226 Difference]: Without dead ends: 1295 [2022-11-02 19:57:13,365 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-02 19:57:13,373 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:13,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:57:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-11-02 19:57:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1293. [2022-11-02 19:57:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 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-02 19:57:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1874 transitions. [2022-11-02 19:57:13,532 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1874 transitions. Word has length 53 [2022-11-02 19:57:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:13,533 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1874 transitions. [2022-11-02 19:57:13,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02 19:57:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1874 transitions. [2022-11-02 19:57:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 19:57:13,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:13,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:13,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:57:13,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1724922721, now seen corresponding path program 1 times [2022-11-02 19:57:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:13,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75802047] [2022-11-02 19:57:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:13,782 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-02 19:57:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:13,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75802047] [2022-11-02 19:57:13,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75802047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:13,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:13,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:57:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786555960] [2022-11-02 19:57:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:13,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:57:13,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:13,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:57:13,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:57:13,788 INFO L87 Difference]: Start difference. First operand 1293 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-02 19:57:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:14,182 INFO L93 Difference]: Finished difference Result 2516 states and 3713 transitions. [2022-11-02 19:57:14,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:57:14,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2022-11-02 19:57:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:14,196 INFO L225 Difference]: With dead ends: 2516 [2022-11-02 19:57:14,196 INFO L226 Difference]: Without dead ends: 2150 [2022-11-02 19:57:14,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:14,199 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 634 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:14,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1128 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:57:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-11-02 19:57:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1745. [2022-11-02 19:57:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 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-02 19:57:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2543 transitions. [2022-11-02 19:57:14,484 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2543 transitions. Word has length 54 [2022-11-02 19:57:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:14,486 INFO L495 AbstractCegarLoop]: Abstraction has 1745 states and 2543 transitions. [2022-11-02 19:57:14,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-02 19:57:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2543 transitions. [2022-11-02 19:57:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 19:57:14,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:14,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:14,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 19:57:14,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1943574737, now seen corresponding path program 1 times [2022-11-02 19:57:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:14,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139669729] [2022-11-02 19:57:14,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:14,688 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-02 19:57:14,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:14,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139669729] [2022-11-02 19:57:14,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139669729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:14,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:14,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:57:14,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353312991] [2022-11-02 19:57:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:14,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:57:14,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:14,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:57:14,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:57:14,692 INFO L87 Difference]: Start difference. First operand 1745 states and 2543 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-02 19:57:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:15,119 INFO L93 Difference]: Finished difference Result 2968 states and 4382 transitions. [2022-11-02 19:57:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:57:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2022-11-02 19:57:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:15,132 INFO L225 Difference]: With dead ends: 2968 [2022-11-02 19:57:15,132 INFO L226 Difference]: Without dead ends: 2602 [2022-11-02 19:57:15,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:15,136 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 624 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:15,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1029 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:57:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-11-02 19:57:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2091. [2022-11-02 19:57:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 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-02 19:57:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3058 transitions. [2022-11-02 19:57:15,405 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3058 transitions. Word has length 54 [2022-11-02 19:57:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:15,406 INFO L495 AbstractCegarLoop]: Abstraction has 2091 states and 3058 transitions. [2022-11-02 19:57:15,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-02 19:57:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3058 transitions. [2022-11-02 19:57:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 19:57:15,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:15,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:15,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 19:57:15,408 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:15,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash -867408349, now seen corresponding path program 1 times [2022-11-02 19:57:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:15,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759807314] [2022-11-02 19:57:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,578 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-02 19:57:15,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759807314] [2022-11-02 19:57:15,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759807314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:15,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:15,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:57:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953111482] [2022-11-02 19:57:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:15,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:57:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:57:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:57:15,581 INFO L87 Difference]: Start difference. First operand 2091 states and 3058 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-02 19:57:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:16,041 INFO L93 Difference]: Finished difference Result 3367 states and 4972 transitions. [2022-11-02 19:57:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:57:16,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2022-11-02 19:57:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:16,055 INFO L225 Difference]: With dead ends: 3367 [2022-11-02 19:57:16,055 INFO L226 Difference]: Without dead ends: 3001 [2022-11-02 19:57:16,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:16,059 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 628 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:16,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1128 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:57:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2022-11-02 19:57:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2382. [2022-11-02 19:57:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 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-02 19:57:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3492 transitions. [2022-11-02 19:57:16,369 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3492 transitions. Word has length 54 [2022-11-02 19:57:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:16,370 INFO L495 AbstractCegarLoop]: Abstraction has 2382 states and 3492 transitions. [2022-11-02 19:57:16,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-02 19:57:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3492 transitions. [2022-11-02 19:57:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 19:57:16,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:16,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:16,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 19:57:16,373 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:16,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash -554993830, now seen corresponding path program 1 times [2022-11-02 19:57:16,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:16,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544148959] [2022-11-02 19:57:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:16,517 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-02 19:57:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:16,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544148959] [2022-11-02 19:57:16,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544148959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:16,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:16,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:57:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14979735] [2022-11-02 19:57:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:16,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:57:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:57:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:57:16,520 INFO L87 Difference]: Start difference. First operand 2382 states and 3492 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-02 19:57:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:17,284 INFO L93 Difference]: Finished difference Result 5669 states and 8297 transitions. [2022-11-02 19:57:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:57:17,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2022-11-02 19:57:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:17,297 INFO L225 Difference]: With dead ends: 5669 [2022-11-02 19:57:17,297 INFO L226 Difference]: Without dead ends: 3315 [2022-11-02 19:57:17,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:17,304 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 888 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:17,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 208 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:57:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2022-11-02 19:57:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3288. [2022-11-02 19:57:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3287 states have (on average 1.4432613325220567) internal successors, (4744), 3287 states have internal predecessors, (4744), 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-02 19:57:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4744 transitions. [2022-11-02 19:57:17,839 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4744 transitions. Word has length 58 [2022-11-02 19:57:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:17,840 INFO L495 AbstractCegarLoop]: Abstraction has 3288 states and 4744 transitions. [2022-11-02 19:57:17,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-02 19:57:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4744 transitions. [2022-11-02 19:57:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 19:57:17,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:17,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:17,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 19:57:17,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:17,845 INFO L85 PathProgramCache]: Analyzing trace with hash 500702524, now seen corresponding path program 1 times [2022-11-02 19:57:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:17,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563539498] [2022-11-02 19:57:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:17,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:17,967 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-02 19:57:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:17,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563539498] [2022-11-02 19:57:17,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563539498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:17,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:17,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:57:17,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492527937] [2022-11-02 19:57:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:17,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:57:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:57:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:57:17,972 INFO L87 Difference]: Start difference. First operand 3288 states and 4744 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-02 19:57:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:19,004 INFO L93 Difference]: Finished difference Result 7833 states and 11294 transitions. [2022-11-02 19:57:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:57:19,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2022-11-02 19:57:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:19,022 INFO L225 Difference]: With dead ends: 7833 [2022-11-02 19:57:19,023 INFO L226 Difference]: Without dead ends: 4591 [2022-11-02 19:57:19,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:19,031 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 876 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:19,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 226 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:57:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2022-11-02 19:57:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4566. [2022-11-02 19:57:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4566 states, 4565 states have (on average 1.4297918948521358) internal successors, (6527), 4565 states have internal predecessors, (6527), 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-02 19:57:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4566 states to 4566 states and 6527 transitions. [2022-11-02 19:57:19,750 INFO L78 Accepts]: Start accepts. Automaton has 4566 states and 6527 transitions. Word has length 58 [2022-11-02 19:57:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:19,751 INFO L495 AbstractCegarLoop]: Abstraction has 4566 states and 6527 transitions. [2022-11-02 19:57:19,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-02 19:57:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4566 states and 6527 transitions. [2022-11-02 19:57:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 19:57:19,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:19,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:19,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 19:57:19,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1531409244, now seen corresponding path program 1 times [2022-11-02 19:57:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:19,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770242087] [2022-11-02 19:57:19,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:19,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:19,875 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-02 19:57:19,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770242087] [2022-11-02 19:57:19,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770242087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:19,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:19,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:57:19,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135979152] [2022-11-02 19:57:19,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:19,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:57:19,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:57:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:57:19,878 INFO L87 Difference]: Start difference. First operand 4566 states and 6527 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-02 19:57:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:21,220 INFO L93 Difference]: Finished difference Result 10822 states and 15448 transitions. [2022-11-02 19:57:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:57:21,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2022-11-02 19:57:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:21,243 INFO L225 Difference]: With dead ends: 10822 [2022-11-02 19:57:21,243 INFO L226 Difference]: Without dead ends: 6338 [2022-11-02 19:57:21,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:21,251 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 831 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:21,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 228 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:57:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-11-02 19:57:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6303. [2022-11-02 19:57:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6303 states, 6302 states have (on average 1.4136781973976515) internal successors, (8909), 6302 states have internal predecessors, (8909), 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-02 19:57:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6303 states to 6303 states and 8909 transitions. [2022-11-02 19:57:22,218 INFO L78 Accepts]: Start accepts. Automaton has 6303 states and 8909 transitions. Word has length 59 [2022-11-02 19:57:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:22,218 INFO L495 AbstractCegarLoop]: Abstraction has 6303 states and 8909 transitions. [2022-11-02 19:57:22,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-02 19:57:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6303 states and 8909 transitions. [2022-11-02 19:57:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 19:57:22,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:22,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:22,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 19:57:22,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash -97252013, now seen corresponding path program 1 times [2022-11-02 19:57:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:22,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500568533] [2022-11-02 19:57:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:22,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:57:22,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:22,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500568533] [2022-11-02 19:57:22,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500568533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:22,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:22,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:57:22,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355659922] [2022-11-02 19:57:22,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:22,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:57:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:57:22,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:22,405 INFO L87 Difference]: Start difference. First operand 6303 states and 8909 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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-02 19:57:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:25,871 INFO L93 Difference]: Finished difference Result 24311 states and 34246 transitions. [2022-11-02 19:57:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:57:25,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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) Word has length 60 [2022-11-02 19:57:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:25,931 INFO L225 Difference]: With dead ends: 24311 [2022-11-02 19:57:25,931 INFO L226 Difference]: Without dead ends: 21033 [2022-11-02 19:57:25,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:57:25,942 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 2032 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:25,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 343 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:57:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21033 states. [2022-11-02 19:57:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21033 to 6323. [2022-11-02 19:57:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6323 states, 6322 states have (on average 1.4130022144890857) internal successors, (8933), 6322 states have internal predecessors, (8933), 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-02 19:57:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 8933 transitions. [2022-11-02 19:57:27,494 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 8933 transitions. Word has length 60 [2022-11-02 19:57:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:27,495 INFO L495 AbstractCegarLoop]: Abstraction has 6323 states and 8933 transitions. [2022-11-02 19:57:27,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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-02 19:57:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 8933 transitions. [2022-11-02 19:57:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 19:57:27,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:27,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:27,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 19:57:27,501 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash -172891724, now seen corresponding path program 1 times [2022-11-02 19:57:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:27,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274602557] [2022-11-02 19:57:27,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:27,680 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-02 19:57:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:27,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274602557] [2022-11-02 19:57:27,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274602557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:27,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:27,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:57:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046723884] [2022-11-02 19:57:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:27,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:57:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:57:27,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:27,684 INFO L87 Difference]: Start difference. First operand 6323 states and 8933 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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-02 19:57:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:32,345 INFO L93 Difference]: Finished difference Result 28525 states and 40259 transitions. [2022-11-02 19:57:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:57:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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) Word has length 60 [2022-11-02 19:57:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:32,421 INFO L225 Difference]: With dead ends: 28525 [2022-11-02 19:57:32,421 INFO L226 Difference]: Without dead ends: 25419 [2022-11-02 19:57:32,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:57:32,433 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 2323 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:32,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 388 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:57:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25419 states. [2022-11-02 19:57:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25419 to 6417. [2022-11-02 19:57:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6417 states, 6416 states have (on average 1.4111596009975063) internal successors, (9054), 6416 states have internal predecessors, (9054), 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-02 19:57:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6417 states to 6417 states and 9054 transitions. [2022-11-02 19:57:34,056 INFO L78 Accepts]: Start accepts. Automaton has 6417 states and 9054 transitions. Word has length 60 [2022-11-02 19:57:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:34,056 INFO L495 AbstractCegarLoop]: Abstraction has 6417 states and 9054 transitions. [2022-11-02 19:57:34,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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-02 19:57:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6417 states and 9054 transitions. [2022-11-02 19:57:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 19:57:34,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:34,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:34,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 19:57:34,062 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2054897963, now seen corresponding path program 1 times [2022-11-02 19:57:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:34,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960790455] [2022-11-02 19:57:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:34,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:34,246 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-02 19:57:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:34,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960790455] [2022-11-02 19:57:34,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960790455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:34,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:34,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:57:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897671062] [2022-11-02 19:57:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:34,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:57:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:34,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:57:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:57:34,249 INFO L87 Difference]: Start difference. First operand 6417 states and 9054 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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-02 19:57:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:40,982 INFO L93 Difference]: Finished difference Result 34344 states and 48423 transitions. [2022-11-02 19:57:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:57:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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) Word has length 60 [2022-11-02 19:57:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:41,072 INFO L225 Difference]: With dead ends: 34344 [2022-11-02 19:57:41,073 INFO L226 Difference]: Without dead ends: 31246 [2022-11-02 19:57:41,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:57:41,085 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 2695 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:41,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 410 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:57:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31246 states. [2022-11-02 19:57:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31246 to 6473. [2022-11-02 19:57:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6473 states, 6472 states have (on average 1.409610630407911) internal successors, (9123), 6472 states have internal predecessors, (9123), 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-02 19:57:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6473 states to 6473 states and 9123 transitions. [2022-11-02 19:57:43,173 INFO L78 Accepts]: Start accepts. Automaton has 6473 states and 9123 transitions. Word has length 60 [2022-11-02 19:57:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:43,174 INFO L495 AbstractCegarLoop]: Abstraction has 6473 states and 9123 transitions. [2022-11-02 19:57:43,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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-02 19:57:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6473 states and 9123 transitions. [2022-11-02 19:57:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 19:57:43,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:43,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:43,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 19:57:43,179 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:43,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1036507303, now seen corresponding path program 1 times [2022-11-02 19:57:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:43,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516121473] [2022-11-02 19:57:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:43,746 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-02 19:57:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:43,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516121473] [2022-11-02 19:57:43,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516121473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:43,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:43,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:57:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198234791] [2022-11-02 19:57:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:43,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:57:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:57:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:57:43,750 INFO L87 Difference]: Start difference. First operand 6473 states and 9123 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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-02 19:57:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:50,602 INFO L93 Difference]: Finished difference Result 24418 states and 34421 transitions. [2022-11-02 19:57:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 19:57:50,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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 62 [2022-11-02 19:57:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:50,644 INFO L225 Difference]: With dead ends: 24418 [2022-11-02 19:57:50,644 INFO L226 Difference]: Without dead ends: 19216 [2022-11-02 19:57:50,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-11-02 19:57:50,654 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 2010 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:50,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 1549 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 19:57:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19216 states. [2022-11-02 19:57:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 6341. [2022-11-02 19:57:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6341 states, 6340 states have (on average 1.407570977917981) internal successors, (8924), 6340 states have internal predecessors, (8924), 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-02 19:57:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6341 states to 6341 states and 8924 transitions. [2022-11-02 19:57:52,483 INFO L78 Accepts]: Start accepts. Automaton has 6341 states and 8924 transitions. Word has length 62 [2022-11-02 19:57:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:52,484 INFO L495 AbstractCegarLoop]: Abstraction has 6341 states and 8924 transitions. [2022-11-02 19:57:52,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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-02 19:57:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6341 states and 8924 transitions. [2022-11-02 19:57:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 19:57:52,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:52,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:52,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 19:57:52,489 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:57:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1459319080, now seen corresponding path program 1 times [2022-11-02 19:57:52,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:52,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846559541] [2022-11-02 19:57:52,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:52,918 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-02 19:57:52,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:52,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846559541] [2022-11-02 19:57:52,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846559541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:52,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:52,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:57:52,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911760110] [2022-11-02 19:57:52,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:52,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:57:52,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:52,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:57:52,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:57:52,920 INFO L87 Difference]: Start difference. First operand 6341 states and 8924 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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-02 19:58:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:00,876 INFO L93 Difference]: Finished difference Result 24550 states and 34500 transitions. [2022-11-02 19:58:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 19:58:00,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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 62 [2022-11-02 19:58:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:00,901 INFO L225 Difference]: With dead ends: 24550 [2022-11-02 19:58:00,901 INFO L226 Difference]: Without dead ends: 19255 [2022-11-02 19:58:00,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-11-02 19:58:00,912 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 1926 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1926 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:00,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1926 Valid, 1584 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 19:58:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19255 states. [2022-11-02 19:58:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19255 to 6144. [2022-11-02 19:58:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6144 states, 6143 states have (on average 1.4061533452710402) internal successors, (8638), 6143 states have internal predecessors, (8638), 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-02 19:58:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6144 states to 6144 states and 8638 transitions. [2022-11-02 19:58:02,943 INFO L78 Accepts]: Start accepts. Automaton has 6144 states and 8638 transitions. Word has length 62 [2022-11-02 19:58:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:02,944 INFO L495 AbstractCegarLoop]: Abstraction has 6144 states and 8638 transitions. [2022-11-02 19:58:02,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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-02 19:58:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6144 states and 8638 transitions. [2022-11-02 19:58:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 19:58:02,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:02,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:58:02,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 19:58:02,948 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:58:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2010042985, now seen corresponding path program 1 times [2022-11-02 19:58:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:02,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649134992] [2022-11-02 19:58:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:03,283 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-02 19:58:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:03,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649134992] [2022-11-02 19:58:03,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649134992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:03,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:58:03,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:58:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638009128] [2022-11-02 19:58:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:03,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:58:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:03,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:58:03,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:58:03,286 INFO L87 Difference]: Start difference. First operand 6144 states and 8638 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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-02 19:58:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:10,192 INFO L93 Difference]: Finished difference Result 21217 states and 29874 transitions. [2022-11-02 19:58:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 19:58:10,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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 62 [2022-11-02 19:58:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:10,212 INFO L225 Difference]: With dead ends: 21217 [2022-11-02 19:58:10,212 INFO L226 Difference]: Without dead ends: 15981 [2022-11-02 19:58:10,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2022-11-02 19:58:10,218 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 2094 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2094 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:10,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2094 Valid, 1309 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 19:58:10,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15981 states. [2022-11-02 19:58:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15981 to 6003. [2022-11-02 19:58:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6003 states, 6002 states have (on average 1.406697767410863) internal successors, (8443), 6002 states have internal predecessors, (8443), 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-02 19:58:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 8443 transitions. [2022-11-02 19:58:12,262 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 8443 transitions. Word has length 62 [2022-11-02 19:58:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:12,262 INFO L495 AbstractCegarLoop]: Abstraction has 6003 states and 8443 transitions. [2022-11-02 19:58:12,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 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-02 19:58:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 8443 transitions. [2022-11-02 19:58:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 19:58:12,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:12,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:58:12,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 19:58:12,267 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:58:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1983119998, now seen corresponding path program 1 times [2022-11-02 19:58:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:12,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256439289] [2022-11-02 19:58:12,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:12,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:12,341 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-02 19:58:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:12,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256439289] [2022-11-02 19:58:12,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256439289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:12,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:58:12,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:58:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888258529] [2022-11-02 19:58:12,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:12,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:58:12,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:12,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:58:12,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:58:12,344 INFO L87 Difference]: Start difference. First operand 6003 states and 8443 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02 19:58:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:14,351 INFO L93 Difference]: Finished difference Result 9060 states and 12752 transitions. [2022-11-02 19:58:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:58:14,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2022-11-02 19:58:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:14,359 INFO L225 Difference]: With dead ends: 9060 [2022-11-02 19:58:14,360 INFO L226 Difference]: Without dead ends: 5806 [2022-11-02 19:58:14,364 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-02 19:58:14,365 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 148 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:14,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 521 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:58:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5806 states. [2022-11-02 19:58:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5806 to 5804. [2022-11-02 19:58:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5804 states, 5803 states have (on average 1.387558159572635) internal successors, (8052), 5803 states have internal predecessors, (8052), 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-02 19:58:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5804 states to 5804 states and 8052 transitions. [2022-11-02 19:58:16,343 INFO L78 Accepts]: Start accepts. Automaton has 5804 states and 8052 transitions. Word has length 63 [2022-11-02 19:58:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:16,343 INFO L495 AbstractCegarLoop]: Abstraction has 5804 states and 8052 transitions. [2022-11-02 19:58:16,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02 19:58:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5804 states and 8052 transitions. [2022-11-02 19:58:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 19:58:16,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:16,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:58:16,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 19:58:16,347 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:58:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1051173576, now seen corresponding path program 1 times [2022-11-02 19:58:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:16,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079383385] [2022-11-02 19:58:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:16,404 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-02 19:58:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079383385] [2022-11-02 19:58:16,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079383385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:16,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:58:16,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:58:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82799116] [2022-11-02 19:58:16,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:16,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:58:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:16,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:58:16,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:58:16,407 INFO L87 Difference]: Start difference. First operand 5804 states and 8052 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02 19:58:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:18,097 INFO L93 Difference]: Finished difference Result 8092 states and 11221 transitions. [2022-11-02 19:58:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:58:18,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2022-11-02 19:58:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:18,104 INFO L225 Difference]: With dead ends: 8092 [2022-11-02 19:58:18,104 INFO L226 Difference]: Without dead ends: 5023 [2022-11-02 19:58:18,107 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-02 19:58:18,108 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 134 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:18,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 513 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:58:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2022-11-02 19:58:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5021. [2022-11-02 19:58:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5021 states, 5020 states have (on average 1.3629482071713148) internal successors, (6842), 5020 states have internal predecessors, (6842), 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-02 19:58:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 6842 transitions. [2022-11-02 19:58:19,885 INFO L78 Accepts]: Start accepts. Automaton has 5021 states and 6842 transitions. Word has length 63 [2022-11-02 19:58:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:19,885 INFO L495 AbstractCegarLoop]: Abstraction has 5021 states and 6842 transitions. [2022-11-02 19:58:19,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02 19:58:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5021 states and 6842 transitions. [2022-11-02 19:58:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 19:58:19,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:19,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:58:19,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 19:58:19,890 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:58:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash -125701859, now seen corresponding path program 1 times [2022-11-02 19:58:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:19,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936049793] [2022-11-02 19:58:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:19,956 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-02 19:58:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:19,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936049793] [2022-11-02 19:58:19,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936049793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:19,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:58:19,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:58:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069930238] [2022-11-02 19:58:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:19,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:58:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:19,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:58:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:58:19,961 INFO L87 Difference]: Start difference. First operand 5021 states and 6842 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02 19:58:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:21,701 INFO L93 Difference]: Finished difference Result 6625 states and 9028 transitions. [2022-11-02 19:58:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:58:21,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2022-11-02 19:58:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:21,706 INFO L225 Difference]: With dead ends: 6625 [2022-11-02 19:58:21,707 INFO L226 Difference]: Without dead ends: 3867 [2022-11-02 19:58:21,710 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-02 19:58:21,711 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 146 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:21,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 524 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:58:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2022-11-02 19:58:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3865. [2022-11-02 19:58:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3865 states, 3864 states have (on average 1.3382505175983437) internal successors, (5171), 3864 states have internal predecessors, (5171), 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-02 19:58:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 5171 transitions. [2022-11-02 19:58:23,109 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 5171 transitions. Word has length 63 [2022-11-02 19:58:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:23,109 INFO L495 AbstractCegarLoop]: Abstraction has 3865 states and 5171 transitions. [2022-11-02 19:58:23,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02 19:58:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 5171 transitions. [2022-11-02 19:58:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 19:58:23,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:23,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:58:23,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 19:58:23,114 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:58:23,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash 666404545, now seen corresponding path program 1 times [2022-11-02 19:58:23,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:23,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810989592] [2022-11-02 19:58:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:23,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:23,171 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-02 19:58:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:23,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810989592] [2022-11-02 19:58:23,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810989592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:23,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:58:23,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:58:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648467806] [2022-11-02 19:58:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:23,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:58:23,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:58:23,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:58:23,174 INFO L87 Difference]: Start difference. First operand 3865 states and 5171 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02 19:58:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:25,026 INFO L93 Difference]: Finished difference Result 7116 states and 9579 transitions. [2022-11-02 19:58:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:58:25,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-11-02 19:58:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:25,034 INFO L225 Difference]: With dead ends: 7116 [2022-11-02 19:58:25,034 INFO L226 Difference]: Without dead ends: 5197 [2022-11-02 19:58:25,037 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-02 19:58:25,038 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 171 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:25,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 343 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:58:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2022-11-02 19:58:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 3680. [2022-11-02 19:58:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3679 states have (on average 1.337048110899701) internal successors, (4919), 3679 states have internal predecessors, (4919), 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-02 19:58:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4919 transitions. [2022-11-02 19:58:26,256 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 4919 transitions. Word has length 64 [2022-11-02 19:58:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:26,256 INFO L495 AbstractCegarLoop]: Abstraction has 3680 states and 4919 transitions. [2022-11-02 19:58:26,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02 19:58:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4919 transitions. [2022-11-02 19:58:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 19:58:26,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:26,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:58:26,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 19:58:26,261 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:58:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:26,262 INFO L85 PathProgramCache]: Analyzing trace with hash 859970200, now seen corresponding path program 1 times [2022-11-02 19:58:26,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:26,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333054838] [2022-11-02 19:58:26,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:26,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:27,990 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-02 19:58:27,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:27,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333054838] [2022-11-02 19:58:27,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333054838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:27,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:58:27,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 19:58:27,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429913514] [2022-11-02 19:58:27,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:27,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 19:58:27,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 19:58:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:58:27,993 INFO L87 Difference]: Start difference. First operand 3680 states and 4919 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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-02 19:58:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:36,865 INFO L93 Difference]: Finished difference Result 7604 states and 10239 transitions. [2022-11-02 19:58:36,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 19:58:36,866 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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 64 [2022-11-02 19:58:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:36,878 INFO L225 Difference]: With dead ends: 7604 [2022-11-02 19:58:36,878 INFO L226 Difference]: Without dead ends: 7537 [2022-11-02 19:58:36,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 19:58:36,883 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 2436 mSDsluCounter, 6151 mSDsCounter, 0 mSdLazyCounter, 3620 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 6590 SdHoareTripleChecker+Invalid, 3657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:36,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 6590 Invalid, 3657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3620 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-02 19:58:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7537 states. [2022-11-02 19:58:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7537 to 3692. [2022-11-02 19:58:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 3691 states have (on average 1.3367651043077757) internal successors, (4934), 3691 states have internal predecessors, (4934), 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-02 19:58:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 4934 transitions. [2022-11-02 19:58:38,664 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 4934 transitions. Word has length 64 [2022-11-02 19:58:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:38,664 INFO L495 AbstractCegarLoop]: Abstraction has 3692 states and 4934 transitions. [2022-11-02 19:58:38,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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-02 19:58:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 4934 transitions. [2022-11-02 19:58:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 19:58:38,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:38,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:58:38,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 19:58:38,670 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:58:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1948770272, now seen corresponding path program 1 times [2022-11-02 19:58:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:38,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667100209] [2022-11-02 19:58:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:40,176 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-02 19:58:40,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:40,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667100209] [2022-11-02 19:58:40,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667100209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:40,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:58:40,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 19:58:40,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248618361] [2022-11-02 19:58:40,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:40,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 19:58:40,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:40,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 19:58:40,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:58:40,179 INFO L87 Difference]: Start difference. First operand 3692 states and 4934 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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-02 19:58:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:49,040 INFO L93 Difference]: Finished difference Result 7070 states and 9522 transitions. [2022-11-02 19:58:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 19:58:49,041 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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 64 [2022-11-02 19:58:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:49,049 INFO L225 Difference]: With dead ends: 7070 [2022-11-02 19:58:49,049 INFO L226 Difference]: Without dead ends: 7003 [2022-11-02 19:58:49,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 19:58:49,052 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 1703 mSDsluCounter, 5620 mSDsCounter, 0 mSdLazyCounter, 3432 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 6053 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:49,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 6053 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3432 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 19:58:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7003 states. [2022-11-02 19:58:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7003 to 3692. [2022-11-02 19:58:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 3691 states have (on average 1.3364941750203196) internal successors, (4933), 3691 states have internal predecessors, (4933), 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-02 19:58:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 4933 transitions. [2022-11-02 19:58:50,489 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 4933 transitions. Word has length 64 [2022-11-02 19:58:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:50,489 INFO L495 AbstractCegarLoop]: Abstraction has 3692 states and 4933 transitions. [2022-11-02 19:58:50,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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-02 19:58:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 4933 transitions. [2022-11-02 19:58:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 19:58:50,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:50,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:58:50,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 19:58:50,493 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:58:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash 682523932, now seen corresponding path program 1 times [2022-11-02 19:58:50,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:50,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81806178] [2022-11-02 19:58:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:50,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:51,987 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-02 19:58:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:51,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81806178] [2022-11-02 19:58:51,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81806178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:51,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:58:51,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 19:58:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455155502] [2022-11-02 19:58:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 19:58:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 19:58:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:58:51,990 INFO L87 Difference]: Start difference. First operand 3692 states and 4933 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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-02 19:59:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:01,052 INFO L93 Difference]: Finished difference Result 7502 states and 10092 transitions. [2022-11-02 19:59:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 19:59:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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 64 [2022-11-02 19:59:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:01,062 INFO L225 Difference]: With dead ends: 7502 [2022-11-02 19:59:01,062 INFO L226 Difference]: Without dead ends: 7435 [2022-11-02 19:59:01,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=345, Invalid=1461, Unknown=0, NotChecked=0, Total=1806 [2022-11-02 19:59:01,065 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 2500 mSDsluCounter, 6815 mSDsCounter, 0 mSdLazyCounter, 4197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2500 SdHoareTripleChecker+Valid, 7311 SdHoareTripleChecker+Invalid, 4237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:01,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2500 Valid, 7311 Invalid, 4237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4197 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-02 19:59:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-11-02 19:59:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 3698. [2022-11-02 19:59:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3698 states, 3697 states have (on average 1.3362185555856099) internal successors, (4940), 3697 states have internal predecessors, (4940), 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-02 19:59:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 4940 transitions. [2022-11-02 19:59:02,491 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 4940 transitions. Word has length 64 [2022-11-02 19:59:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:59:02,491 INFO L495 AbstractCegarLoop]: Abstraction has 3698 states and 4940 transitions. [2022-11-02 19:59:02,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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-02 19:59:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 4940 transitions. [2022-11-02 19:59:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 19:59:02,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:59:02,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:59:02,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 19:59:02,495 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:59:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:59:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1079669093, now seen corresponding path program 1 times [2022-11-02 19:59:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:59:02,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713244673] [2022-11-02 19:59:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:59:02,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:59:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:59:02,546 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-02 19:59:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:59:02,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713244673] [2022-11-02 19:59:02,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713244673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:59:02,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:59:02,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:59:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553483924] [2022-11-02 19:59:02,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:59:02,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:59:02,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:59:02,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:59:02,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:59:02,550 INFO L87 Difference]: Start difference. First operand 3698 states and 4940 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02 19:59:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:05,073 INFO L93 Difference]: Finished difference Result 6782 states and 9122 transitions. [2022-11-02 19:59:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:59:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-11-02 19:59:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:05,080 INFO L225 Difference]: With dead ends: 6782 [2022-11-02 19:59:05,081 INFO L226 Difference]: Without dead ends: 4960 [2022-11-02 19:59:05,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-02 19:59:05,084 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 173 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:05,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 344 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:59:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2022-11-02 19:59:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 3488. [2022-11-02 19:59:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 3487 states have (on average 1.335818755377115) internal successors, (4658), 3487 states have internal predecessors, (4658), 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-02 19:59:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4658 transitions. [2022-11-02 19:59:06,415 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4658 transitions. Word has length 64 [2022-11-02 19:59:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:59:06,415 INFO L495 AbstractCegarLoop]: Abstraction has 3488 states and 4658 transitions. [2022-11-02 19:59:06,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02 19:59:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4658 transitions. [2022-11-02 19:59:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 19:59:06,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:59:06,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:59:06,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 19:59:06,417 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:59:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:59:06,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2017308149, now seen corresponding path program 1 times [2022-11-02 19:59:06,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:59:06,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808333029] [2022-11-02 19:59:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:59:06,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:59:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:59:06,466 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-02 19:59:06,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:59:06,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808333029] [2022-11-02 19:59:06,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808333029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:59:06,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:59:06,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:59:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023485286] [2022-11-02 19:59:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:59:06,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:59:06,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:59:06,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:59:06,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:59:06,470 INFO L87 Difference]: Start difference. First operand 3488 states and 4658 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02 19:59:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:08,664 INFO L93 Difference]: Finished difference Result 6445 states and 8659 transitions. [2022-11-02 19:59:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:59:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-11-02 19:59:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:08,669 INFO L225 Difference]: With dead ends: 6445 [2022-11-02 19:59:08,669 INFO L226 Difference]: Without dead ends: 4645 [2022-11-02 19:59:08,672 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-02 19:59:08,673 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 166 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:08,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 331 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:59:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2022-11-02 19:59:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3269. [2022-11-02 19:59:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 3268 states have (on average 1.3347613219094248) internal successors, (4362), 3268 states have internal predecessors, (4362), 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-02 19:59:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4362 transitions. [2022-11-02 19:59:10,015 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4362 transitions. Word has length 64 [2022-11-02 19:59:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:59:10,016 INFO L495 AbstractCegarLoop]: Abstraction has 3269 states and 4362 transitions. [2022-11-02 19:59:10,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02 19:59:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4362 transitions. [2022-11-02 19:59:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 19:59:10,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:59:10,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:59:10,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 19:59:10,018 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:59:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:59:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash 144276108, now seen corresponding path program 1 times [2022-11-02 19:59:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:59:10,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244156406] [2022-11-02 19:59:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:59:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:59:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:59:10,688 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-02 19:59:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:59:10,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244156406] [2022-11-02 19:59:10,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244156406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:59:10,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:59:10,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:59:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552239511] [2022-11-02 19:59:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:59:10,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:59:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:59:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:59:10,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:59:10,690 INFO L87 Difference]: Start difference. First operand 3269 states and 4362 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-02 19:59:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:16,076 INFO L93 Difference]: Finished difference Result 7419 states and 9996 transitions. [2022-11-02 19:59:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 19:59:16,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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 65 [2022-11-02 19:59:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:16,084 INFO L225 Difference]: With dead ends: 7419 [2022-11-02 19:59:16,084 INFO L226 Difference]: Without dead ends: 7071 [2022-11-02 19:59:16,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:59:16,087 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 1501 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:16,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 3060 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 19:59:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2022-11-02 19:59:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 3203. [2022-11-02 19:59:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3203 states, 3202 states have (on average 1.3357276702061212) internal successors, (4277), 3202 states have internal predecessors, (4277), 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-02 19:59:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 3203 states and 4277 transitions. [2022-11-02 19:59:17,531 INFO L78 Accepts]: Start accepts. Automaton has 3203 states and 4277 transitions. Word has length 65 [2022-11-02 19:59:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:59:17,531 INFO L495 AbstractCegarLoop]: Abstraction has 3203 states and 4277 transitions. [2022-11-02 19:59:17,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-02 19:59:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3203 states and 4277 transitions. [2022-11-02 19:59:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 19:59:17,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:59:17,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:59:17,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 19:59:17,533 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:59:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:59:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 402441546, now seen corresponding path program 1 times [2022-11-02 19:59:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:59:17,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477950949] [2022-11-02 19:59:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:59:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:59:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:59:18,447 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-02 19:59:18,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:59:18,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477950949] [2022-11-02 19:59:18,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477950949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:59:18,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:59:18,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 19:59:18,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446640443] [2022-11-02 19:59:18,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:59:18,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 19:59:18,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:59:18,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 19:59:18,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-11-02 19:59:18,450 INFO L87 Difference]: Start difference. First operand 3203 states and 4277 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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-02 19:59:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:27,254 INFO L93 Difference]: Finished difference Result 8369 states and 11302 transitions. [2022-11-02 19:59:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 19:59:27,254 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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 65 [2022-11-02 19:59:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:27,263 INFO L225 Difference]: With dead ends: 8369 [2022-11-02 19:59:27,263 INFO L226 Difference]: Without dead ends: 8044 [2022-11-02 19:59:27,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2022-11-02 19:59:27,265 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 2039 mSDsluCounter, 5738 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 6416 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:27,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 6416 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 19:59:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8044 states. [2022-11-02 19:59:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8044 to 3142. [2022-11-02 19:59:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3141 states have (on average 1.3358802929003502) internal successors, (4196), 3141 states have internal predecessors, (4196), 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-02 19:59:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4196 transitions. [2022-11-02 19:59:28,898 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4196 transitions. Word has length 65 [2022-11-02 19:59:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:59:28,899 INFO L495 AbstractCegarLoop]: Abstraction has 3142 states and 4196 transitions. [2022-11-02 19:59:28,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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-02 19:59:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4196 transitions. [2022-11-02 19:59:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 19:59:28,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:59:28,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:59:28,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 19:59:28,901 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:59:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:59:28,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1563174538, now seen corresponding path program 1 times [2022-11-02 19:59:28,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:59:28,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68997121] [2022-11-02 19:59:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:59:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:59:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:59:29,008 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-02 19:59:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:59:29,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68997121] [2022-11-02 19:59:29,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68997121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:59:29,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:59:29,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:59:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928059758] [2022-11-02 19:59:29,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:59:29,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:59:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:59:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:59:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:59:29,010 INFO L87 Difference]: Start difference. First operand 3142 states and 4196 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-02 19:59:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:30,801 INFO L93 Difference]: Finished difference Result 3148 states and 4199 transitions. [2022-11-02 19:59:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:59:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2022-11-02 19:59:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:30,805 INFO L225 Difference]: With dead ends: 3148 [2022-11-02 19:59:30,806 INFO L226 Difference]: Without dead ends: 2705 [2022-11-02 19:59:30,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:59:30,808 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 422 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:30,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 752 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:59:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2022-11-02 19:59:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2701. [2022-11-02 19:59:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.3403703703703704) internal successors, (3619), 2700 states have internal predecessors, (3619), 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-02 19:59:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3619 transitions. [2022-11-02 19:59:32,311 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3619 transitions. Word has length 69 [2022-11-02 19:59:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:59:32,312 INFO L495 AbstractCegarLoop]: Abstraction has 2701 states and 3619 transitions. [2022-11-02 19:59:32,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-02 19:59:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3619 transitions. [2022-11-02 19:59:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 19:59:32,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:59:32,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:59:32,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 19:59:32,314 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:59:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:59:32,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1535111263, now seen corresponding path program 1 times [2022-11-02 19:59:32,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:59:32,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334552333] [2022-11-02 19:59:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:59:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:59:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:59:32,437 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-02 19:59:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:59:32,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334552333] [2022-11-02 19:59:32,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334552333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:59:32,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:59:32,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:59:32,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636930646] [2022-11-02 19:59:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:59:32,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:59:32,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:59:32,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:59:32,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:59:32,441 INFO L87 Difference]: Start difference. First operand 2701 states and 3619 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-02 19:59:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:35,256 INFO L93 Difference]: Finished difference Result 6990 states and 9463 transitions. [2022-11-02 19:59:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:59:35,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2022-11-02 19:59:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:35,263 INFO L225 Difference]: With dead ends: 6990 [2022-11-02 19:59:35,263 INFO L226 Difference]: Without dead ends: 4682 [2022-11-02 19:59:35,265 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-02 19:59:35,266 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 113 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:35,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 426 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:59:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2022-11-02 19:59:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4386. [2022-11-02 19:59:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4386 states, 4385 states have (on average 1.3388825541619156) internal successors, (5871), 4385 states have internal predecessors, (5871), 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-02 19:59:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 5871 transitions. [2022-11-02 19:59:37,702 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 5871 transitions. Word has length 72 [2022-11-02 19:59:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:59:37,702 INFO L495 AbstractCegarLoop]: Abstraction has 4386 states and 5871 transitions. [2022-11-02 19:59:37,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-02 19:59:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 5871 transitions. [2022-11-02 19:59:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 19:59:37,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:59:37,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:59:37,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 19:59:37,704 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:59:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:59:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1480821562, now seen corresponding path program 1 times [2022-11-02 19:59:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:59:37,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858125503] [2022-11-02 19:59:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:59:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:59:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:59:37,840 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-02 19:59:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:59:37,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858125503] [2022-11-02 19:59:37,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858125503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:59:37,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:59:37,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:59:37,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549847735] [2022-11-02 19:59:37,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:59:37,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:59:37,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:59:37,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:59:37,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:59:37,843 INFO L87 Difference]: Start difference. First operand 4386 states and 5871 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02 19:59:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:42,950 INFO L93 Difference]: Finished difference Result 11938 states and 16077 transitions. [2022-11-02 19:59:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:59:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2022-11-02 19:59:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:42,960 INFO L225 Difference]: With dead ends: 11938 [2022-11-02 19:59:42,960 INFO L226 Difference]: Without dead ends: 7957 [2022-11-02 19:59:42,963 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-02 19:59:42,964 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 103 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:42,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:59:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2022-11-02 19:59:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 7367. [2022-11-02 19:59:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7367 states, 7366 states have (on average 1.3349171870757535) internal successors, (9833), 7366 states have internal predecessors, (9833), 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-02 19:59:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 9833 transitions. [2022-11-02 19:59:47,189 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 9833 transitions. Word has length 73 [2022-11-02 19:59:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:59:47,189 INFO L495 AbstractCegarLoop]: Abstraction has 7367 states and 9833 transitions. [2022-11-02 19:59:47,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02 19:59:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 9833 transitions. [2022-11-02 19:59:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 19:59:47,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:59:47,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:59:47,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 19:59:47,191 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:59:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:59:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1423402598, now seen corresponding path program 1 times [2022-11-02 19:59:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:59:47,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182450855] [2022-11-02 19:59:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:59:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:59:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:59:47,288 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-02 19:59:47,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:59:47,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182450855] [2022-11-02 19:59:47,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182450855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:59:47,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:59:47,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:59:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520721136] [2022-11-02 19:59:47,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:59:47,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:59:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:59:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:59:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:59:47,291 INFO L87 Difference]: Start difference. First operand 7367 states and 9833 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-02 19:59:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:59:56,469 INFO L93 Difference]: Finished difference Result 20471 states and 27331 transitions. [2022-11-02 19:59:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:59:56,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2022-11-02 19:59:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:59:56,488 INFO L225 Difference]: With dead ends: 20471 [2022-11-02 19:59:56,488 INFO L226 Difference]: Without dead ends: 13509 [2022-11-02 19:59:56,494 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-02 19:59:56,495 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 93 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:59:56,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 408 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:59:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13509 states. [2022-11-02 20:00:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13509 to 12331. [2022-11-02 20:00:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12331 states, 12330 states have (on average 1.3220600162206002) internal successors, (16301), 12330 states have internal predecessors, (16301), 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-02 20:00:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12331 states to 12331 states and 16301 transitions. [2022-11-02 20:00:03,855 INFO L78 Accepts]: Start accepts. Automaton has 12331 states and 16301 transitions. Word has length 74 [2022-11-02 20:00:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:00:03,855 INFO L495 AbstractCegarLoop]: Abstraction has 12331 states and 16301 transitions. [2022-11-02 20:00:03,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-02 20:00:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12331 states and 16301 transitions. [2022-11-02 20:00:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:00:03,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:00:03,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:00:03,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:00:03,857 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:00:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:00:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2071973989, now seen corresponding path program 1 times [2022-11-02 20:00:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:00:03,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383256005] [2022-11-02 20:00:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:00:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:00:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:00:04,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-02 20:00:04,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:00:04,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383256005] [2022-11-02 20:00:04,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383256005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:00:04,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:00:04,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:00:04,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767105237] [2022-11-02 20:00:04,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:00:04,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:00:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:00:04,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:00:04,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:00:04,065 INFO L87 Difference]: Start difference. First operand 12331 states and 16301 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-02 20:00:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:00:21,921 INFO L93 Difference]: Finished difference Result 26363 states and 34333 transitions. [2022-11-02 20:00:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:00:21,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2022-11-02 20:00:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:00:21,959 INFO L225 Difference]: With dead ends: 26363 [2022-11-02 20:00:21,959 INFO L226 Difference]: Without dead ends: 26361 [2022-11-02 20:00:21,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:00:21,965 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 327 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:00:21,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 980 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:00:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26361 states. [2022-11-02 20:00:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26361 to 13603. [2022-11-02 20:00:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13603 states, 13602 states have (on average 1.2919423614174386) internal successors, (17573), 13602 states have internal predecessors, (17573), 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-02 20:00:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13603 states to 13603 states and 17573 transitions. [2022-11-02 20:00:31,432 INFO L78 Accepts]: Start accepts. Automaton has 13603 states and 17573 transitions. Word has length 77 [2022-11-02 20:00:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:00:31,432 INFO L495 AbstractCegarLoop]: Abstraction has 13603 states and 17573 transitions. [2022-11-02 20:00:31,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-02 20:00:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13603 states and 17573 transitions. [2022-11-02 20:00:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:00:31,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:00:31,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:00:31,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:00:31,435 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:00:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:00:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1914492299, now seen corresponding path program 1 times [2022-11-02 20:00:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:00:31,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630913341] [2022-11-02 20:00:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:00:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:00:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:00:31,488 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-02 20:00:31,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:00:31,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630913341] [2022-11-02 20:00:31,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630913341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:00:31,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:00:31,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:00:31,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252745893] [2022-11-02 20:00:31,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:00:31,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:00:31,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:00:31,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:00:31,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:00:31,491 INFO L87 Difference]: Start difference. First operand 13603 states and 17573 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:00:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:00:44,409 INFO L93 Difference]: Finished difference Result 33419 states and 42967 transitions. [2022-11-02 20:00:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:00:44,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:00:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:00:44,436 INFO L225 Difference]: With dead ends: 33419 [2022-11-02 20:00:44,436 INFO L226 Difference]: Without dead ends: 20221 [2022-11-02 20:00:44,445 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-02 20:00:44,446 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 129 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:00:44,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 338 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:00:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20221 states.