./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R --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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- 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-38b53e6 [2022-11-25 15:50:04,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:50:04,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:50:04,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:50:04,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:50:04,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:50:04,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:50:04,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:50:04,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:50:04,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:50:04,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:50:04,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:50:04,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:50:04,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:50:04,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:50:04,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:50:04,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:50:04,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:50:04,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:50:04,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:50:04,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:50:04,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:50:04,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:50:04,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:50:04,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:50:04,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:50:04,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:50:04,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:50:04,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:50:04,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:50:04,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:50:04,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:50:04,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:50:04,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:50:04,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:50:04,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:50:04,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:50:04,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:50:04,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:50:04,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:50:04,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:50:04,664 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:50:04,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:50:04,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:50:04,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:50:04,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:50:04,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:50:04,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:50:04,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:50:04,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:50:04,694 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:50:04,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:50:04,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:50:04,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:50:04,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:50:04,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:50:04,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:50:04,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:50:04,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:50:04,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:50:04,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:50:04,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:50:04,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:50:04,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:50:04,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:50:04,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:50:04,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:50:04,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:50:04,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:50:04,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:50:04,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:50:04,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:50:04,701 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:50:04,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:50:04,701 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:50:04,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:50:04,702 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/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_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-11-25 15:50:05,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:50:05,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:50:05,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:50:05,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:50:05,062 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:50:05,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/locks/test_locks_13.c [2022-11-25 15:50:08,359 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:50:08,579 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:50:08,580 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/sv-benchmarks/c/locks/test_locks_13.c [2022-11-25 15:50:08,589 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/data/f486ac936/e3b7310039c74441bdb6a85fa6f8b26d/FLAGb2c74238f [2022-11-25 15:50:08,608 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/data/f486ac936/e3b7310039c74441bdb6a85fa6f8b26d [2022-11-25 15:50:08,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:50:08,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:50:08,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:50:08,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:50:08,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:50:08,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:08,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c091fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08, skipping insertion in model container [2022-11-25 15:50:08,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:08,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:50:08,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:50:08,867 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-11-25 15:50:08,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:50:08,887 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:50:08,924 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-11-25 15:50:08,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:50:08,941 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:50:08,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08 WrapperNode [2022-11-25 15:50:08,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:50:08,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:50:08,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:50:08,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:50:08,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:08,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:08,983 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 171 [2022-11-25 15:50:08,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:50:08,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:50:08,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:50:08,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:50:08,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:08,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:08,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:08,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:09,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:09,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:09,011 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:09,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:09,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:50:09,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:50:09,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:50:09,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:50:09,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (1/1) ... [2022-11-25 15:50:09,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:50:09,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:09,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:50:09,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_175c62e8-441d-4569-a27d-590f004ca43c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:50:09,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:50:09,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:50:09,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:50:09,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:50:09,211 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:50:09,213 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:50:09,634 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:50:09,643 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:50:09,643 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:50:09,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:50:09 BoogieIcfgContainer [2022-11-25 15:50:09,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:50:09,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:50:09,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:50:09,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:50:09,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:50:08" (1/3) ... [2022-11-25 15:50:09,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eebb8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:50:09, skipping insertion in model container [2022-11-25 15:50:09,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:08" (2/3) ... [2022-11-25 15:50:09,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eebb8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:50:09, skipping insertion in model container [2022-11-25 15:50:09,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:50:09" (3/3) ... [2022-11-25 15:50:09,659 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-11-25 15:50:09,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:50:09,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:50:09,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:50:09,771 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;@6bc13999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:50:09,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:50:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 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-25 15:50:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 15:50:09,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:09,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:09,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1359894467, now seen corresponding path program 1 times [2022-11-25 15:50:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:09,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31702244] [2022-11-25 15:50:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:10,147 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-25 15:50:10,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:10,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31702244] [2022-11-25 15:50:10,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31702244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:10,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:10,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806115295] [2022-11-25 15:50:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:10,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:10,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:10,201 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:10,265 INFO L93 Difference]: Finished difference Result 101 states and 181 transitions. [2022-11-25 15:50:10,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:10,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 15:50:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:10,281 INFO L225 Difference]: With dead ends: 101 [2022-11-25 15:50:10,281 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 15:50:10,285 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-25 15:50:10,289 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:10,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 15:50:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2022-11-25 15:50:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2022-11-25 15:50:10,339 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2022-11-25 15:50:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:10,340 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2022-11-25 15:50:10,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2022-11-25 15:50:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 15:50:10,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:10,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:10,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:50:10,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1914004475, now seen corresponding path program 1 times [2022-11-25 15:50:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:10,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419536958] [2022-11-25 15:50:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:10,439 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-25 15:50:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:10,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419536958] [2022-11-25 15:50:10,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419536958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:10,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:10,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471567070] [2022-11-25 15:50:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:10,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:10,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:10,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:10,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:10,444 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:10,480 INFO L93 Difference]: Finished difference Result 144 states and 269 transitions. [2022-11-25 15:50:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:10,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 15:50:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:10,482 INFO L225 Difference]: With dead ends: 144 [2022-11-25 15:50:10,482 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 15:50:10,483 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-25 15:50:10,485 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:10,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 15:50:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-11-25 15:50:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 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-25 15:50:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2022-11-25 15:50:10,500 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2022-11-25 15:50:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:10,500 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2022-11-25 15:50:10,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2022-11-25 15:50:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 15:50:10,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:10,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:10,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:50:10,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:10,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash 793156859, now seen corresponding path program 1 times [2022-11-25 15:50:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:10,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357826563] [2022-11-25 15:50:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:10,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:10,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-25 15:50:10,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:10,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357826563] [2022-11-25 15:50:10,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357826563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:10,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:10,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:10,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096361092] [2022-11-25 15:50:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:10,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:10,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:10,629 INFO L87 Difference]: Start difference. First operand 85 states and 158 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:10,660 INFO L93 Difference]: Finished difference Result 132 states and 240 transitions. [2022-11-25 15:50:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:10,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 15:50:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:10,663 INFO L225 Difference]: With dead ends: 132 [2022-11-25 15:50:10,663 INFO L226 Difference]: Without dead ends: 90 [2022-11-25 15:50:10,664 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-25 15:50:10,665 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:10,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-25 15:50:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-11-25 15:50:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 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-25 15:50:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2022-11-25 15:50:10,678 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2022-11-25 15:50:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:10,678 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2022-11-25 15:50:10,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2022-11-25 15:50:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 15:50:10,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:10,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:10,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:50:10,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:10,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash -795191043, now seen corresponding path program 1 times [2022-11-25 15:50:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:10,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048343474] [2022-11-25 15:50:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:10,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-25 15:50:10,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:10,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048343474] [2022-11-25 15:50:10,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048343474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:10,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:10,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154419700] [2022-11-25 15:50:10,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:10,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:10,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:10,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:10,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:10,750 INFO L87 Difference]: Start difference. First operand 88 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:10,777 INFO L93 Difference]: Finished difference Result 169 states and 309 transitions. [2022-11-25 15:50:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:10,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 15:50:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:10,780 INFO L225 Difference]: With dead ends: 169 [2022-11-25 15:50:10,780 INFO L226 Difference]: Without dead ends: 167 [2022-11-25 15:50:10,781 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-25 15:50:10,782 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:10,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-25 15:50:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2022-11-25 15:50:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 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-25 15:50:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2022-11-25 15:50:10,799 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2022-11-25 15:50:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:10,799 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2022-11-25 15:50:10,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2022-11-25 15:50:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 15:50:10,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:10,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:10,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:50:10,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1816259397, now seen corresponding path program 1 times [2022-11-25 15:50:10,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:10,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893596060] [2022-11-25 15:50:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:10,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:10,859 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-25 15:50:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:10,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893596060] [2022-11-25 15:50:10,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893596060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:10,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:10,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853255876] [2022-11-25 15:50:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:10,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:10,863 INFO L87 Difference]: Start difference. First operand 117 states and 213 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:10,892 INFO L93 Difference]: Finished difference Result 281 states and 515 transitions. [2022-11-25 15:50:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 15:50:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:10,895 INFO L225 Difference]: With dead ends: 281 [2022-11-25 15:50:10,895 INFO L226 Difference]: Without dead ends: 169 [2022-11-25 15:50:10,896 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-25 15:50:10,898 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:10,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:10,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-25 15:50:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2022-11-25 15:50:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 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-25 15:50:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2022-11-25 15:50:10,914 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2022-11-25 15:50:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:10,915 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2022-11-25 15:50:10,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2022-11-25 15:50:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 15:50:10,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:10,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:10,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:50:10,918 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1119094160, now seen corresponding path program 1 times [2022-11-25 15:50:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:10,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608648437] [2022-11-25 15:50:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:10,972 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-25 15:50:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:10,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608648437] [2022-11-25 15:50:10,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608648437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:10,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:10,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182163456] [2022-11-25 15:50:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:10,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:10,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:10,976 INFO L87 Difference]: Start difference. First operand 167 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:11,000 INFO L93 Difference]: Finished difference Result 252 states and 454 transitions. [2022-11-25 15:50:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 15:50:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:11,003 INFO L225 Difference]: With dead ends: 252 [2022-11-25 15:50:11,003 INFO L226 Difference]: Without dead ends: 171 [2022-11-25 15:50:11,004 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-25 15:50:11,005 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:11,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-25 15:50:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-11-25 15:50:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 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-25 15:50:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2022-11-25 15:50:11,023 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2022-11-25 15:50:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:11,023 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2022-11-25 15:50:11,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2022-11-25 15:50:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 15:50:11,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:11,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:11,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:50:11,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:11,027 INFO L85 PathProgramCache]: Analyzing trace with hash -469253742, now seen corresponding path program 1 times [2022-11-25 15:50:11,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:11,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427600525] [2022-11-25 15:50:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:11,107 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-25 15:50:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:11,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427600525] [2022-11-25 15:50:11,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427600525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:11,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:11,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:11,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771009117] [2022-11-25 15:50:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:11,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:11,112 INFO L87 Difference]: Start difference. First operand 169 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:11,160 INFO L93 Difference]: Finished difference Result 489 states and 881 transitions. [2022-11-25 15:50:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:11,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 15:50:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:11,163 INFO L225 Difference]: With dead ends: 489 [2022-11-25 15:50:11,164 INFO L226 Difference]: Without dead ends: 327 [2022-11-25 15:50:11,165 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-25 15:50:11,167 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:11,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-25 15:50:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2022-11-25 15:50:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 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-25 15:50:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 579 transitions. [2022-11-25 15:50:11,201 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 579 transitions. Word has length 22 [2022-11-25 15:50:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:11,202 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 579 transitions. [2022-11-25 15:50:11,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 579 transitions. [2022-11-25 15:50:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 15:50:11,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:11,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:11,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:50:11,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash 551814612, now seen corresponding path program 1 times [2022-11-25 15:50:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:11,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697344723] [2022-11-25 15:50:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:11,312 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-25 15:50:11,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:11,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697344723] [2022-11-25 15:50:11,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697344723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:11,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:11,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845610706] [2022-11-25 15:50:11,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:11,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:11,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:11,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:11,316 INFO L87 Difference]: Start difference. First operand 325 states and 579 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:11,353 INFO L93 Difference]: Finished difference Result 417 states and 749 transitions. [2022-11-25 15:50:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:11,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 15:50:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:11,356 INFO L225 Difference]: With dead ends: 417 [2022-11-25 15:50:11,356 INFO L226 Difference]: Without dead ends: 415 [2022-11-25 15:50:11,357 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-25 15:50:11,358 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:11,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-25 15:50:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2022-11-25 15:50:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 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-25 15:50:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2022-11-25 15:50:11,404 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2022-11-25 15:50:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:11,404 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2022-11-25 15:50:11,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2022-11-25 15:50:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 15:50:11,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:11,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:11,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:50:11,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1661751056, now seen corresponding path program 1 times [2022-11-25 15:50:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:11,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916907922] [2022-11-25 15:50:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:11,520 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-25 15:50:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:11,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916907922] [2022-11-25 15:50:11,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916907922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:11,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:11,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178374796] [2022-11-25 15:50:11,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:11,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:11,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:11,524 INFO L87 Difference]: Start difference. First operand 325 states and 575 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:11,564 INFO L93 Difference]: Finished difference Result 613 states and 1097 transitions. [2022-11-25 15:50:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:11,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 15:50:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:11,569 INFO L225 Difference]: With dead ends: 613 [2022-11-25 15:50:11,569 INFO L226 Difference]: Without dead ends: 611 [2022-11-25 15:50:11,571 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-25 15:50:11,579 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:11,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-25 15:50:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2022-11-25 15:50:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 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-25 15:50:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 783 transitions. [2022-11-25 15:50:11,609 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 783 transitions. Word has length 23 [2022-11-25 15:50:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:11,609 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 783 transitions. [2022-11-25 15:50:11,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 783 transitions. [2022-11-25 15:50:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 15:50:11,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:11,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:11,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:50:11,622 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1612147886, now seen corresponding path program 1 times [2022-11-25 15:50:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002250396] [2022-11-25 15:50:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:11,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:11,692 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-25 15:50:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:11,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002250396] [2022-11-25 15:50:11,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002250396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:11,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:11,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270498069] [2022-11-25 15:50:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:11,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:11,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:11,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:11,697 INFO L87 Difference]: Start difference. First operand 449 states and 783 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:11,726 INFO L93 Difference]: Finished difference Result 1077 states and 1889 transitions. [2022-11-25 15:50:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:11,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 15:50:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:11,732 INFO L225 Difference]: With dead ends: 1077 [2022-11-25 15:50:11,732 INFO L226 Difference]: Without dead ends: 635 [2022-11-25 15:50:11,737 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-25 15:50:11,739 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:11,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-11-25 15:50:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2022-11-25 15:50:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 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-25 15:50:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1099 transitions. [2022-11-25 15:50:11,774 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1099 transitions. Word has length 23 [2022-11-25 15:50:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:11,775 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 1099 transitions. [2022-11-25 15:50:11,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1099 transitions. [2022-11-25 15:50:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 15:50:11,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:11,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:11,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:50:11,778 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:11,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 25538215, now seen corresponding path program 1 times [2022-11-25 15:50:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:11,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038921420] [2022-11-25 15:50:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:11,854 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-25 15:50:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:11,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038921420] [2022-11-25 15:50:11,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038921420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:11,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:11,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146117876] [2022-11-25 15:50:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:11,860 INFO L87 Difference]: Start difference. First operand 633 states and 1099 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:11,901 INFO L93 Difference]: Finished difference Result 957 states and 1657 transitions. [2022-11-25 15:50:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:11,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 15:50:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:11,906 INFO L225 Difference]: With dead ends: 957 [2022-11-25 15:50:11,906 INFO L226 Difference]: Without dead ends: 647 [2022-11-25 15:50:11,908 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-25 15:50:11,912 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:11,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-25 15:50:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2022-11-25 15:50:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 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-25 15:50:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1107 transitions. [2022-11-25 15:50:11,940 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1107 transitions. Word has length 24 [2022-11-25 15:50:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:11,942 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1107 transitions. [2022-11-25 15:50:11,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1107 transitions. [2022-11-25 15:50:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 15:50:11,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:11,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:11,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:50:11,954 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:11,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1562809687, now seen corresponding path program 1 times [2022-11-25 15:50:11,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:11,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112780011] [2022-11-25 15:50:11,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:12,015 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-25 15:50:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:12,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112780011] [2022-11-25 15:50:12,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112780011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:12,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:12,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517198939] [2022-11-25 15:50:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:12,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:12,021 INFO L87 Difference]: Start difference. First operand 645 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:12,053 INFO L93 Difference]: Finished difference Result 1193 states and 2077 transitions. [2022-11-25 15:50:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:12,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 15:50:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:12,059 INFO L225 Difference]: With dead ends: 1193 [2022-11-25 15:50:12,059 INFO L226 Difference]: Without dead ends: 1191 [2022-11-25 15:50:12,060 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-25 15:50:12,061 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:12,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-11-25 15:50:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 901. [2022-11-25 15:50:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 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-25 15:50:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1515 transitions. [2022-11-25 15:50:12,097 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1515 transitions. Word has length 24 [2022-11-25 15:50:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:12,098 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1515 transitions. [2022-11-25 15:50:12,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1515 transitions. [2022-11-25 15:50:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 15:50:12,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:12,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:12,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:50:12,101 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1711089255, now seen corresponding path program 1 times [2022-11-25 15:50:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:12,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954684048] [2022-11-25 15:50:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:12,153 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-25 15:50:12,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:12,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954684048] [2022-11-25 15:50:12,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954684048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:12,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:12,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888625899] [2022-11-25 15:50:12,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:12,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:12,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:12,157 INFO L87 Difference]: Start difference. First operand 901 states and 1515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:12,196 INFO L93 Difference]: Finished difference Result 2137 states and 3613 transitions. [2022-11-25 15:50:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:12,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 15:50:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:12,204 INFO L225 Difference]: With dead ends: 2137 [2022-11-25 15:50:12,204 INFO L226 Difference]: Without dead ends: 1255 [2022-11-25 15:50:12,206 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-25 15:50:12,207 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:12,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2022-11-25 15:50:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2022-11-25 15:50:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 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-25 15:50:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2099 transitions. [2022-11-25 15:50:12,252 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2099 transitions. Word has length 24 [2022-11-25 15:50:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:12,253 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 2099 transitions. [2022-11-25 15:50:12,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2099 transitions. [2022-11-25 15:50:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 15:50:12,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:12,255 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] [2022-11-25 15:50:12,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:50:12,255 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1202246301, now seen corresponding path program 1 times [2022-11-25 15:50:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:12,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693802123] [2022-11-25 15:50:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:12,305 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-25 15:50:12,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:12,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693802123] [2022-11-25 15:50:12,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693802123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:12,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:12,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:12,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872348217] [2022-11-25 15:50:12,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:12,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:12,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:12,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:12,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:12,308 INFO L87 Difference]: Start difference. First operand 1253 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-25 15:50:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:12,341 INFO L93 Difference]: Finished difference Result 1881 states and 3141 transitions. [2022-11-25 15:50:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:12,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-25 15:50:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:12,350 INFO L225 Difference]: With dead ends: 1881 [2022-11-25 15:50:12,350 INFO L226 Difference]: Without dead ends: 1271 [2022-11-25 15:50:12,351 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-25 15:50:12,352 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:12,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-11-25 15:50:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2022-11-25 15:50:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 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-25 15:50:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2099 transitions. [2022-11-25 15:50:12,398 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2099 transitions. Word has length 25 [2022-11-25 15:50:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:12,398 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 2099 transitions. [2022-11-25 15:50:12,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-25 15:50:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2099 transitions. [2022-11-25 15:50:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 15:50:12,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:12,400 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] [2022-11-25 15:50:12,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:50:12,400 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1504373093, now seen corresponding path program 1 times [2022-11-25 15:50:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:12,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399715911] [2022-11-25 15:50:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:12,443 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-25 15:50:12,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:12,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399715911] [2022-11-25 15:50:12,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399715911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:12,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:12,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:12,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052756485] [2022-11-25 15:50:12,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:12,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:12,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:12,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:12,446 INFO L87 Difference]: Start difference. First operand 1269 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-25 15:50:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:12,497 INFO L93 Difference]: Finished difference Result 2313 states and 3893 transitions. [2022-11-25 15:50:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:12,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-25 15:50:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:12,505 INFO L225 Difference]: With dead ends: 2313 [2022-11-25 15:50:12,506 INFO L226 Difference]: Without dead ends: 2311 [2022-11-25 15:50:12,508 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-25 15:50:12,508 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:12,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-11-25 15:50:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1797. [2022-11-25 15:50:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 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-25 15:50:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2899 transitions. [2022-11-25 15:50:12,580 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2899 transitions. Word has length 25 [2022-11-25 15:50:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:12,580 INFO L495 AbstractCegarLoop]: Abstraction has 1797 states and 2899 transitions. [2022-11-25 15:50:12,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-25 15:50:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2899 transitions. [2022-11-25 15:50:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 15:50:12,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:12,583 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] [2022-11-25 15:50:12,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:50:12,583 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash 483304739, now seen corresponding path program 1 times [2022-11-25 15:50:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:12,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135348390] [2022-11-25 15:50:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:12,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-25 15:50:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:12,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135348390] [2022-11-25 15:50:12,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135348390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:12,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:12,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924744383] [2022-11-25 15:50:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:12,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:12,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:12,630 INFO L87 Difference]: Start difference. First operand 1797 states and 2899 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-25 15:50:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:12,697 INFO L93 Difference]: Finished difference Result 4233 states and 6869 transitions. [2022-11-25 15:50:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-25 15:50:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:12,705 INFO L225 Difference]: With dead ends: 4233 [2022-11-25 15:50:12,706 INFO L226 Difference]: Without dead ends: 2471 [2022-11-25 15:50:12,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-25 15:50:12,711 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:12,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-11-25 15:50:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2469. [2022-11-25 15:50:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 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-25 15:50:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3971 transitions. [2022-11-25 15:50:12,838 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3971 transitions. Word has length 25 [2022-11-25 15:50:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:12,839 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 3971 transitions. [2022-11-25 15:50:12,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-25 15:50:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3971 transitions. [2022-11-25 15:50:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 15:50:12,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:12,842 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] [2022-11-25 15:50:12,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:50:12,842 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:12,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash -608860292, now seen corresponding path program 1 times [2022-11-25 15:50:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:12,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615876613] [2022-11-25 15:50:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:12,884 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-25 15:50:12,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:12,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615876613] [2022-11-25 15:50:12,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615876613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:12,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:12,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916025684] [2022-11-25 15:50:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:12,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:12,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:12,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:12,888 INFO L87 Difference]: Start difference. First operand 2469 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 15:50:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:12,961 INFO L93 Difference]: Finished difference Result 3705 states and 5941 transitions. [2022-11-25 15:50:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:12,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-25 15:50:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:12,970 INFO L225 Difference]: With dead ends: 3705 [2022-11-25 15:50:12,970 INFO L226 Difference]: Without dead ends: 2503 [2022-11-25 15:50:12,972 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-25 15:50:12,973 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:12,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2022-11-25 15:50:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2022-11-25 15:50:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 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-25 15:50:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3971 transitions. [2022-11-25 15:50:13,067 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3971 transitions. Word has length 26 [2022-11-25 15:50:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:13,067 INFO L495 AbstractCegarLoop]: Abstraction has 2501 states and 3971 transitions. [2022-11-25 15:50:13,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 15:50:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3971 transitions. [2022-11-25 15:50:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 15:50:13,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:13,070 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] [2022-11-25 15:50:13,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:50:13,071 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2097759102, now seen corresponding path program 1 times [2022-11-25 15:50:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:13,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68569254] [2022-11-25 15:50:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:13,102 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-25 15:50:13,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:13,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68569254] [2022-11-25 15:50:13,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68569254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:13,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:13,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:13,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720037384] [2022-11-25 15:50:13,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:13,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:13,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:13,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:13,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:13,104 INFO L87 Difference]: Start difference. First operand 2501 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 15:50:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:13,196 INFO L93 Difference]: Finished difference Result 4489 states and 7269 transitions. [2022-11-25 15:50:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-25 15:50:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:13,211 INFO L225 Difference]: With dead ends: 4489 [2022-11-25 15:50:13,211 INFO L226 Difference]: Without dead ends: 4487 [2022-11-25 15:50:13,213 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-25 15:50:13,214 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:13,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-11-25 15:50:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 3589. [2022-11-25 15:50:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 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-25 15:50:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5539 transitions. [2022-11-25 15:50:13,366 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5539 transitions. Word has length 26 [2022-11-25 15:50:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:13,366 INFO L495 AbstractCegarLoop]: Abstraction has 3589 states and 5539 transitions. [2022-11-25 15:50:13,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 15:50:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5539 transitions. [2022-11-25 15:50:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 15:50:13,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:13,371 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] [2022-11-25 15:50:13,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:50:13,371 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1076690748, now seen corresponding path program 1 times [2022-11-25 15:50:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:13,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653403210] [2022-11-25 15:50:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:13,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:13,395 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-25 15:50:13,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:13,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653403210] [2022-11-25 15:50:13,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653403210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:13,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:13,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812039007] [2022-11-25 15:50:13,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:13,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:13,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:13,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:13,397 INFO L87 Difference]: Start difference. First operand 3589 states and 5539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 15:50:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:13,508 INFO L93 Difference]: Finished difference Result 8393 states and 13029 transitions. [2022-11-25 15:50:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-25 15:50:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:13,536 INFO L225 Difference]: With dead ends: 8393 [2022-11-25 15:50:13,536 INFO L226 Difference]: Without dead ends: 4871 [2022-11-25 15:50:13,541 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-25 15:50:13,541 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:13,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2022-11-25 15:50:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4869. [2022-11-25 15:50:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 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-25 15:50:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7491 transitions. [2022-11-25 15:50:13,773 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7491 transitions. Word has length 26 [2022-11-25 15:50:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:13,773 INFO L495 AbstractCegarLoop]: Abstraction has 4869 states and 7491 transitions. [2022-11-25 15:50:13,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 15:50:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7491 transitions. [2022-11-25 15:50:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 15:50:13,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:13,777 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] [2022-11-25 15:50:13,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 15:50:13,778 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash 606237144, now seen corresponding path program 1 times [2022-11-25 15:50:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:13,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614159873] [2022-11-25 15:50:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:13,803 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-25 15:50:13,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:13,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614159873] [2022-11-25 15:50:13,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614159873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:13,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:13,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200697570] [2022-11-25 15:50:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:13,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:13,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:13,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:13,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:13,806 INFO L87 Difference]: Start difference. First operand 4869 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-25 15:50:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:13,904 INFO L93 Difference]: Finished difference Result 7305 states and 11205 transitions. [2022-11-25 15:50:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:13,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-25 15:50:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:13,916 INFO L225 Difference]: With dead ends: 7305 [2022-11-25 15:50:13,916 INFO L226 Difference]: Without dead ends: 4935 [2022-11-25 15:50:13,920 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-25 15:50:13,920 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:13,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2022-11-25 15:50:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4933. [2022-11-25 15:50:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 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-25 15:50:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7491 transitions. [2022-11-25 15:50:14,076 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7491 transitions. Word has length 27 [2022-11-25 15:50:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:14,076 INFO L495 AbstractCegarLoop]: Abstraction has 4933 states and 7491 transitions. [2022-11-25 15:50:14,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-25 15:50:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7491 transitions. [2022-11-25 15:50:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 15:50:14,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:14,081 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] [2022-11-25 15:50:14,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 15:50:14,081 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:14,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:14,082 INFO L85 PathProgramCache]: Analyzing trace with hash -982110758, now seen corresponding path program 1 times [2022-11-25 15:50:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:14,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671098101] [2022-11-25 15:50:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:14,106 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-25 15:50:14,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671098101] [2022-11-25 15:50:14,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671098101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:14,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:14,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896606708] [2022-11-25 15:50:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:14,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:14,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:14,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:14,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:14,108 INFO L87 Difference]: Start difference. First operand 4933 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-25 15:50:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:14,335 INFO L93 Difference]: Finished difference Result 8713 states and 13509 transitions. [2022-11-25 15:50:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:14,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-25 15:50:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:14,362 INFO L225 Difference]: With dead ends: 8713 [2022-11-25 15:50:14,362 INFO L226 Difference]: Without dead ends: 8711 [2022-11-25 15:50:14,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-25 15:50:14,366 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:14,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:50:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2022-11-25 15:50:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 7173. [2022-11-25 15:50:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 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-25 15:50:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 10563 transitions. [2022-11-25 15:50:14,685 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 10563 transitions. Word has length 27 [2022-11-25 15:50:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:14,686 INFO L495 AbstractCegarLoop]: Abstraction has 7173 states and 10563 transitions. [2022-11-25 15:50:14,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-25 15:50:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 10563 transitions. [2022-11-25 15:50:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 15:50:14,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:14,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:14,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 15:50:14,700 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2003179112, now seen corresponding path program 1 times [2022-11-25 15:50:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:14,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390554493] [2022-11-25 15:50:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:14,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:14,740 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-25 15:50:14,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:14,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390554493] [2022-11-25 15:50:14,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390554493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:14,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:14,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236127717] [2022-11-25 15:50:14,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:14,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:14,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:14,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:14,744 INFO L87 Difference]: Start difference. First operand 7173 states and 10563 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-25 15:50:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:15,033 INFO L93 Difference]: Finished difference Result 16649 states and 24645 transitions. [2022-11-25 15:50:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:15,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-25 15:50:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:15,054 INFO L225 Difference]: With dead ends: 16649 [2022-11-25 15:50:15,054 INFO L226 Difference]: Without dead ends: 9607 [2022-11-25 15:50:15,064 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-25 15:50:15,066 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:15,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2022-11-25 15:50:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2022-11-25 15:50:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 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-25 15:50:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14083 transitions. [2022-11-25 15:50:15,479 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14083 transitions. Word has length 27 [2022-11-25 15:50:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:15,480 INFO L495 AbstractCegarLoop]: Abstraction has 9605 states and 14083 transitions. [2022-11-25 15:50:15,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-25 15:50:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14083 transitions. [2022-11-25 15:50:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 15:50:15,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:15,491 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] [2022-11-25 15:50:15,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 15:50:15,491 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash -380447663, now seen corresponding path program 1 times [2022-11-25 15:50:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:15,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758176042] [2022-11-25 15:50:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:50:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:15,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758176042] [2022-11-25 15:50:15,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758176042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:15,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:15,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686974746] [2022-11-25 15:50:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:15,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:15,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:15,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:15,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:15,532 INFO L87 Difference]: Start difference. First operand 9605 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 15:50:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:15,822 INFO L93 Difference]: Finished difference Result 14409 states and 21061 transitions. [2022-11-25 15:50:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:15,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-25 15:50:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:15,841 INFO L225 Difference]: With dead ends: 14409 [2022-11-25 15:50:15,841 INFO L226 Difference]: Without dead ends: 9735 [2022-11-25 15:50:15,847 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-25 15:50:15,848 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:15,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2022-11-25 15:50:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2022-11-25 15:50:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 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-25 15:50:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2022-11-25 15:50:16,212 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2022-11-25 15:50:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:16,212 INFO L495 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2022-11-25 15:50:16,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 15:50:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2022-11-25 15:50:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 15:50:16,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:16,222 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] [2022-11-25 15:50:16,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 15:50:16,226 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1968795565, now seen corresponding path program 1 times [2022-11-25 15:50:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:16,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126964282] [2022-11-25 15:50:16,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:16,252 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-25 15:50:16,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:16,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126964282] [2022-11-25 15:50:16,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126964282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:16,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:16,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:16,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234380309] [2022-11-25 15:50:16,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:16,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:16,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:16,255 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 15:50:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:16,601 INFO L93 Difference]: Finished difference Result 16905 states and 24965 transitions. [2022-11-25 15:50:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:16,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-25 15:50:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:16,640 INFO L225 Difference]: With dead ends: 16905 [2022-11-25 15:50:16,640 INFO L226 Difference]: Without dead ends: 16903 [2022-11-25 15:50:16,645 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-25 15:50:16,646 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:16,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2022-11-25 15:50:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 14341. [2022-11-25 15:50:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 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-25 15:50:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 20099 transitions. [2022-11-25 15:50:17,219 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 20099 transitions. Word has length 28 [2022-11-25 15:50:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:17,220 INFO L495 AbstractCegarLoop]: Abstraction has 14341 states and 20099 transitions. [2022-11-25 15:50:17,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 15:50:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 20099 transitions. [2022-11-25 15:50:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 15:50:17,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:17,246 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] [2022-11-25 15:50:17,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 15:50:17,246 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1305103377, now seen corresponding path program 1 times [2022-11-25 15:50:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:17,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113287462] [2022-11-25 15:50:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:17,291 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-25 15:50:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:17,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113287462] [2022-11-25 15:50:17,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113287462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:17,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:17,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551959010] [2022-11-25 15:50:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:17,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:17,294 INFO L87 Difference]: Start difference. First operand 14341 states and 20099 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 15:50:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:17,779 INFO L93 Difference]: Finished difference Result 33033 states and 46469 transitions. [2022-11-25 15:50:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:17,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-25 15:50:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:17,817 INFO L225 Difference]: With dead ends: 33033 [2022-11-25 15:50:17,818 INFO L226 Difference]: Without dead ends: 18951 [2022-11-25 15:50:17,834 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-25 15:50:17,835 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:17,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2022-11-25 15:50:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18949. [2022-11-25 15:50:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18949 states, 18948 states have (on average 1.3917563858982478) internal successors, (26371), 18948 states have internal predecessors, (26371), 0 states have call successors, (0), 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-25 15:50:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 26371 transitions. [2022-11-25 15:50:18,381 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 26371 transitions. Word has length 28 [2022-11-25 15:50:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:18,381 INFO L495 AbstractCegarLoop]: Abstraction has 18949 states and 26371 transitions. [2022-11-25 15:50:18,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 15:50:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 26371 transitions. [2022-11-25 15:50:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:50:18,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:18,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:50:18,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 15:50:18,452 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:18,453 INFO L85 PathProgramCache]: Analyzing trace with hash -902905267, now seen corresponding path program 1 times [2022-11-25 15:50:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:18,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147338234] [2022-11-25 15:50:18,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:18,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:18,496 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-25 15:50:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:18,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147338234] [2022-11-25 15:50:18,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147338234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:18,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:18,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057852270] [2022-11-25 15:50:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:18,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:18,500 INFO L87 Difference]: Start difference. First operand 18949 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-25 15:50:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:18,810 INFO L93 Difference]: Finished difference Result 28425 states and 39429 transitions. [2022-11-25 15:50:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:18,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-25 15:50:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:18,851 INFO L225 Difference]: With dead ends: 28425 [2022-11-25 15:50:18,851 INFO L226 Difference]: Without dead ends: 19207 [2022-11-25 15:50:18,863 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-25 15:50:18,864 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:18,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2022-11-25 15:50:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 19205. [2022-11-25 15:50:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 19204 states have (on average 1.3732034992709852) internal successors, (26371), 19204 states have internal predecessors, (26371), 0 states have call successors, (0), 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-25 15:50:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 26371 transitions. [2022-11-25 15:50:19,495 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 26371 transitions. Word has length 29 [2022-11-25 15:50:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:19,496 INFO L495 AbstractCegarLoop]: Abstraction has 19205 states and 26371 transitions. [2022-11-25 15:50:19,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-25 15:50:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 26371 transitions. [2022-11-25 15:50:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:50:19,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:19,519 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] [2022-11-25 15:50:19,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 15:50:19,519 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:19,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1803714127, now seen corresponding path program 1 times [2022-11-25 15:50:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:19,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45008163] [2022-11-25 15:50:19,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:19,556 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-25 15:50:19,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:19,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45008163] [2022-11-25 15:50:19,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45008163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:19,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:19,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:19,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454824119] [2022-11-25 15:50:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:19,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:19,559 INFO L87 Difference]: Start difference. First operand 19205 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-25 15:50:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:20,242 INFO L93 Difference]: Finished difference Result 32777 states and 45829 transitions. [2022-11-25 15:50:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-25 15:50:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:20,312 INFO L225 Difference]: With dead ends: 32777 [2022-11-25 15:50:20,313 INFO L226 Difference]: Without dead ends: 32775 [2022-11-25 15:50:20,319 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-25 15:50:20,319 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:20,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32775 states. [2022-11-25 15:50:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32775 to 28677. [2022-11-25 15:50:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28677 states, 28676 states have (on average 1.3302761891477193) internal successors, (38147), 28676 states have internal predecessors, (38147), 0 states have call successors, (0), 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-25 15:50:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 38147 transitions. [2022-11-25 15:50:21,475 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 38147 transitions. Word has length 29 [2022-11-25 15:50:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:21,476 INFO L495 AbstractCegarLoop]: Abstraction has 28677 states and 38147 transitions. [2022-11-25 15:50:21,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-25 15:50:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 38147 transitions. [2022-11-25 15:50:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:50:21,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:21,509 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] [2022-11-25 15:50:21,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 15:50:21,509 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash 782645773, now seen corresponding path program 1 times [2022-11-25 15:50:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:21,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729602142] [2022-11-25 15:50:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:21,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:21,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-25 15:50:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:21,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729602142] [2022-11-25 15:50:21,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729602142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:21,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:21,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294100816] [2022-11-25 15:50:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:21,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:21,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:21,549 INFO L87 Difference]: Start difference. First operand 28677 states and 38147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-25 15:50:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:22,199 INFO L93 Difference]: Finished difference Result 65545 states and 87301 transitions. [2022-11-25 15:50:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:22,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-25 15:50:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:22,267 INFO L225 Difference]: With dead ends: 65545 [2022-11-25 15:50:22,268 INFO L226 Difference]: Without dead ends: 37383 [2022-11-25 15:50:22,298 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-25 15:50:22,299 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:22,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37383 states. [2022-11-25 15:50:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37383 to 37381. [2022-11-25 15:50:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37381 states, 37380 states have (on average 1.315008025682183) internal successors, (49155), 37380 states have internal predecessors, (49155), 0 states have call successors, (0), 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-25 15:50:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37381 states to 37381 states and 49155 transitions. [2022-11-25 15:50:23,552 INFO L78 Accepts]: Start accepts. Automaton has 37381 states and 49155 transitions. Word has length 29 [2022-11-25 15:50:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:23,552 INFO L495 AbstractCegarLoop]: Abstraction has 37381 states and 49155 transitions. [2022-11-25 15:50:23,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-25 15:50:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 37381 states and 49155 transitions. [2022-11-25 15:50:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 15:50:23,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:23,583 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] [2022-11-25 15:50:23,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 15:50:23,583 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 80778534, now seen corresponding path program 1 times [2022-11-25 15:50:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:23,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298639176] [2022-11-25 15:50:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:23,609 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-25 15:50:23,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:23,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298639176] [2022-11-25 15:50:23,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298639176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:23,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:23,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:23,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654684055] [2022-11-25 15:50:23,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:23,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:23,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:23,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:23,612 INFO L87 Difference]: Start difference. First operand 37381 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-25 15:50:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:24,443 INFO L93 Difference]: Finished difference Result 56073 states and 73477 transitions. [2022-11-25 15:50:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:24,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-25 15:50:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:24,501 INFO L225 Difference]: With dead ends: 56073 [2022-11-25 15:50:24,501 INFO L226 Difference]: Without dead ends: 37895 [2022-11-25 15:50:24,520 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-25 15:50:24,520 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:24,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37895 states. [2022-11-25 15:50:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37895 to 37893. [2022-11-25 15:50:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37893 states, 37892 states have (on average 1.2972395228544285) internal successors, (49155), 37892 states have internal predecessors, (49155), 0 states have call successors, (0), 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-25 15:50:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37893 states to 37893 states and 49155 transitions. [2022-11-25 15:50:25,799 INFO L78 Accepts]: Start accepts. Automaton has 37893 states and 49155 transitions. Word has length 30 [2022-11-25 15:50:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:25,800 INFO L495 AbstractCegarLoop]: Abstraction has 37893 states and 49155 transitions. [2022-11-25 15:50:25,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-25 15:50:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 37893 states and 49155 transitions. [2022-11-25 15:50:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 15:50:25,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:25,825 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] [2022-11-25 15:50:25,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 15:50:25,826 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:25,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1507569368, now seen corresponding path program 1 times [2022-11-25 15:50:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:25,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687585790] [2022-11-25 15:50:25,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:25,849 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-25 15:50:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687585790] [2022-11-25 15:50:25,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687585790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:25,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:25,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:25,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914587206] [2022-11-25 15:50:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:25,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:25,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:25,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:25,851 INFO L87 Difference]: Start difference. First operand 37893 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-25 15:50:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:27,092 INFO L93 Difference]: Finished difference Result 110601 states and 141317 transitions. [2022-11-25 15:50:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:27,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-25 15:50:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:27,183 INFO L225 Difference]: With dead ends: 110601 [2022-11-25 15:50:27,183 INFO L226 Difference]: Without dead ends: 73735 [2022-11-25 15:50:27,209 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-25 15:50:27,210 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:27,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73735 states. [2022-11-25 15:50:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73735 to 73733. [2022-11-25 15:50:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2499728747355288) internal successors, (92163), 73732 states have internal predecessors, (92163), 0 states have call successors, (0), 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-25 15:50:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 92163 transitions. [2022-11-25 15:50:28,985 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 92163 transitions. Word has length 30 [2022-11-25 15:50:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:28,985 INFO L495 AbstractCegarLoop]: Abstraction has 73733 states and 92163 transitions. [2022-11-25 15:50:28,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-25 15:50:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 92163 transitions. [2022-11-25 15:50:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 15:50:29,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:29,048 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] [2022-11-25 15:50:29,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 15:50:29,049 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash -486501014, now seen corresponding path program 1 times [2022-11-25 15:50:29,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:29,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472768777] [2022-11-25 15:50:29,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:29,081 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-25 15:50:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:29,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472768777] [2022-11-25 15:50:29,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472768777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:29,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:29,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629377481] [2022-11-25 15:50:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:29,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:29,084 INFO L87 Difference]: Start difference. First operand 73733 states and 92163 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-25 15:50:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:30,343 INFO L93 Difference]: Finished difference Result 79881 states and 102405 transitions. [2022-11-25 15:50:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:30,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-25 15:50:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:30,418 INFO L225 Difference]: With dead ends: 79881 [2022-11-25 15:50:30,418 INFO L226 Difference]: Without dead ends: 79879 [2022-11-25 15:50:30,430 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-25 15:50:30,430 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 33 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:30,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2022-11-25 15:50:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 73733. [2022-11-25 15:50:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2360847393262084) internal successors, (91139), 73732 states have internal predecessors, (91139), 0 states have call successors, (0), 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-25 15:50:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 91139 transitions. [2022-11-25 15:50:32,417 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 91139 transitions. Word has length 30 [2022-11-25 15:50:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:32,418 INFO L495 AbstractCegarLoop]: Abstraction has 73733 states and 91139 transitions. [2022-11-25 15:50:32,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-25 15:50:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 91139 transitions. [2022-11-25 15:50:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 15:50:32,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:32,467 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] [2022-11-25 15:50:32,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 15:50:32,468 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash 510205634, now seen corresponding path program 1 times [2022-11-25 15:50:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:32,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665324559] [2022-11-25 15:50:32,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:32,491 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-25 15:50:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:32,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665324559] [2022-11-25 15:50:32,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665324559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:32,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:32,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280353923] [2022-11-25 15:50:32,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:32,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:32,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:32,494 INFO L87 Difference]: Start difference. First operand 73733 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-25 15:50:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:34,348 INFO L93 Difference]: Finished difference Result 121865 states and 151557 transitions. [2022-11-25 15:50:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-25 15:50:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:34,524 INFO L225 Difference]: With dead ends: 121865 [2022-11-25 15:50:34,524 INFO L226 Difference]: Without dead ends: 121863 [2022-11-25 15:50:34,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-25 15:50:34,567 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:34,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121863 states. [2022-11-25 15:50:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121863 to 113669. [2022-11-25 15:50:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113669 states, 113668 states have (on average 1.2071911179927508) internal successors, (137219), 113668 states have internal predecessors, (137219), 0 states have call successors, (0), 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-25 15:50:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113669 states to 113669 states and 137219 transitions. [2022-11-25 15:50:36,765 INFO L78 Accepts]: Start accepts. Automaton has 113669 states and 137219 transitions. Word has length 31 [2022-11-25 15:50:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:36,765 INFO L495 AbstractCegarLoop]: Abstraction has 113669 states and 137219 transitions. [2022-11-25 15:50:36,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-25 15:50:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 113669 states and 137219 transitions. [2022-11-25 15:50:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 15:50:36,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:36,834 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] [2022-11-25 15:50:36,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 15:50:36,834 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash -510862720, now seen corresponding path program 1 times [2022-11-25 15:50:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:36,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709050945] [2022-11-25 15:50:36,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:50:36,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:36,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709050945] [2022-11-25 15:50:36,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709050945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:36,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:36,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:36,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661358030] [2022-11-25 15:50:36,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:36,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:36,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:36,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:36,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:36,865 INFO L87 Difference]: Start difference. First operand 113669 states and 137219 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-25 15:50:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:39,379 INFO L93 Difference]: Finished difference Result 257033 states and 309253 transitions. [2022-11-25 15:50:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-25 15:50:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:39,562 INFO L225 Difference]: With dead ends: 257033 [2022-11-25 15:50:39,562 INFO L226 Difference]: Without dead ends: 144391 [2022-11-25 15:50:39,640 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-25 15:50:39,641 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 52 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:39,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144391 states. [2022-11-25 15:50:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144391 to 144389. [2022-11-25 15:50:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144389 states, 144388 states have (on average 1.177293126852647) internal successors, (169987), 144388 states have internal predecessors, (169987), 0 states have call successors, (0), 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-25 15:50:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144389 states to 144389 states and 169987 transitions. [2022-11-25 15:50:43,054 INFO L78 Accepts]: Start accepts. Automaton has 144389 states and 169987 transitions. Word has length 31 [2022-11-25 15:50:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:43,054 INFO L495 AbstractCegarLoop]: Abstraction has 144389 states and 169987 transitions. [2022-11-25 15:50:43,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-25 15:50:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 144389 states and 169987 transitions. [2022-11-25 15:50:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 15:50:43,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:43,160 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] [2022-11-25 15:50:43,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 15:50:43,160 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1363278403, now seen corresponding path program 1 times [2022-11-25 15:50:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:43,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348063482] [2022-11-25 15:50:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:43,187 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-25 15:50:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348063482] [2022-11-25 15:50:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348063482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:43,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:43,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945336740] [2022-11-25 15:50:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:43,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:43,190 INFO L87 Difference]: Start difference. First operand 144389 states and 169987 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-25 15:50:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:45,609 INFO L93 Difference]: Finished difference Result 218121 states and 257029 transitions. [2022-11-25 15:50:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:50:45,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-25 15:50:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:45,769 INFO L225 Difference]: With dead ends: 218121 [2022-11-25 15:50:45,770 INFO L226 Difference]: Without dead ends: 147463 [2022-11-25 15:50:45,811 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-25 15:50:45,812 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 54 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:45,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:50:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147463 states. [2022-11-25 15:50:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147463 to 147461. [2022-11-25 15:50:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147461 states, 147460 states have (on average 1.1666553641665536) internal successors, (172035), 147460 states have internal predecessors, (172035), 0 states have call successors, (0), 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-25 15:50:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147461 states to 147461 states and 172035 transitions. [2022-11-25 15:50:49,520 INFO L78 Accepts]: Start accepts. Automaton has 147461 states and 172035 transitions. Word has length 32 [2022-11-25 15:50:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:49,520 INFO L495 AbstractCegarLoop]: Abstraction has 147461 states and 172035 transitions. [2022-11-25 15:50:49,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-25 15:50:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 147461 states and 172035 transitions. [2022-11-25 15:50:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 15:50:49,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:49,595 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] [2022-11-25 15:50:49,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 15:50:49,595 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:50:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1343340991, now seen corresponding path program 1 times [2022-11-25 15:50:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:49,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135112015] [2022-11-25 15:50:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:49,620 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-25 15:50:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:49,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135112015] [2022-11-25 15:50:49,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135112015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:50:49,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:50:49,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:50:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562031728] [2022-11-25 15:50:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:50:49,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:50:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:50:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:50:49,623 INFO L87 Difference]: Start difference. First operand 147461 states and 172035 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)