./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:04:27,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:27,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:27,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:27,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:27,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:27,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:27,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:27,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:27,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:27,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:27,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:27,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:27,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:27,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:27,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:27,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:27,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:27,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:27,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:27,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:27,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:27,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:27,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:27,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:27,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:27,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:27,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:27,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:27,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:27,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:27,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:27,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:27,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:27,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:27,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:27,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:27,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:27,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:27,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:27,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:27,339 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:04:27,384 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:27,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:27,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:27,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:27,386 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:27,386 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:27,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:27,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:27,389 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:27,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:27,391 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:04:27,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:04:27,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:04:27,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:27,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:04:27,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:27,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:04:27,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:04:27,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:04:27,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:27,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:04:27,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:27,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:27,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:27,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:27,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:27,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:27,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:04:27,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:04:27,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:04:27,395 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:04:27,395 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:04:27,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:04:27,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 [2022-11-02 21:04:27,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:27,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:27,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:27,768 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:27,768 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:27,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2022-11-02 21:04:27,849 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/data/03d52a301/8f0bfb1b1a914569903493e20d2c31b4/FLAG89aedcc0d [2022-11-02 21:04:28,520 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:28,521 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2022-11-02 21:04:28,551 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/data/03d52a301/8f0bfb1b1a914569903493e20d2c31b4/FLAG89aedcc0d [2022-11-02 21:04:28,694 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/data/03d52a301/8f0bfb1b1a914569903493e20d2c31b4 [2022-11-02 21:04:28,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:28,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:28,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:28,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:28,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:28,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:28" (1/1) ... [2022-11-02 21:04:28,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0bd64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:28, skipping insertion in model container [2022-11-02 21:04:28,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:28" (1/1) ... [2022-11-02 21:04:28,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:28,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:29,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2022-11-02 21:04:29,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:29,435 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:04:29,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2022-11-02 21:04:29,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:29,641 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:04:29,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29 WrapperNode [2022-11-02 21:04:29,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:29,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:29,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:04:29,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:04:29,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,784 INFO L138 Inliner]: procedures = 92, calls = 338, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 817 [2022-11-02 21:04:29,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:29,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:04:29,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:04:29,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:04:29,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:04:29,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:04:29,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:04:29,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:04:29,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:29,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:29,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:04:29,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d3db40-4db9-4270-a651-b9aa7275c749/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:04:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:04:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2022-11-02 21:04:30,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2022-11-02 21:04:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2022-11-02 21:04:30,042 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2022-11-02 21:04:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2022-11-02 21:04:30,043 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2022-11-02 21:04:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2022-11-02 21:04:30,044 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2022-11-02 21:04:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2022-11-02 21:04:30,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2022-11-02 21:04:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-11-02 21:04:30,044 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-11-02 21:04:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-11-02 21:04:30,045 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-11-02 21:04:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2022-11-02 21:04:30,045 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2022-11-02 21:04:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2022-11-02 21:04:30,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2022-11-02 21:04:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2022-11-02 21:04:30,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2022-11-02 21:04:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2022-11-02 21:04:30,046 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2022-11-02 21:04:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2022-11-02 21:04:30,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2022-11-02 21:04:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2022-11-02 21:04:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2022-11-02 21:04:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2022-11-02 21:04:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2022-11-02 21:04:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2022-11-02 21:04:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2022-11-02 21:04:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2022-11-02 21:04:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2022-11-02 21:04:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2022-11-02 21:04:30,048 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2022-11-02 21:04:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:04:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2022-11-02 21:04:30,049 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2022-11-02 21:04:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2022-11-02 21:04:30,049 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2022-11-02 21:04:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2022-11-02 21:04:30,050 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2022-11-02 21:04:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2022-11-02 21:04:30,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2022-11-02 21:04:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:04:30,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:04:30,051 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2022-11-02 21:04:30,051 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2022-11-02 21:04:30,212 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:04:30,215 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:04:31,626 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:04:31,638 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:04:31,639 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:04:31,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:31 BoogieIcfgContainer [2022-11-02 21:04:31,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:04:31,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:04:31,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:04:31,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:04:31,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:28" (1/3) ... [2022-11-02 21:04:31,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f3b9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:31, skipping insertion in model container [2022-11-02 21:04:31,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29" (2/3) ... [2022-11-02 21:04:31,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f3b9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:31, skipping insertion in model container [2022-11-02 21:04:31,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:31" (3/3) ... [2022-11-02 21:04:31,657 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2022-11-02 21:04:31,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:04:31,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:04:31,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:04:31,773 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;@7d335e2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:04:31,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:04:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 541 states, 426 states have (on average 1.7065727699530517) internal successors, (727), 449 states have internal predecessors, (727), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2022-11-02 21:04:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 21:04:31,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:31,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:31,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:31,806 INFO L85 PathProgramCache]: Analyzing trace with hash -481021737, now seen corresponding path program 1 times [2022-11-02 21:04:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:31,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506070631] [2022-11-02 21:04:31,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:31,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:04:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:04:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 21:04:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:32,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:32,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506070631] [2022-11-02 21:04:32,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506070631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:32,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:32,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523158064] [2022-11-02 21:04:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:32,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:33,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:33,023 INFO L87 Difference]: Start difference. First operand has 541 states, 426 states have (on average 1.7065727699530517) internal successors, (727), 449 states have internal predecessors, (727), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:04:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:39,191 INFO L93 Difference]: Finished difference Result 1224 states and 2085 transitions. [2022-11-02 21:04:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:04:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-11-02 21:04:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:39,239 INFO L225 Difference]: With dead ends: 1224 [2022-11-02 21:04:39,240 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 21:04:39,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:04:39,264 INFO L413 NwaCegarLoop]: 834 mSDtfsCounter, 1085 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:39,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 1680 Invalid, 2333 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [276 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 21:04:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 21:04:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2022-11-02 21:04:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 441 states have internal predecessors, (715), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:04:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 892 transitions. [2022-11-02 21:04:39,463 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 892 transitions. Word has length 56 [2022-11-02 21:04:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:39,464 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 892 transitions. [2022-11-02 21:04:39,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:04:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 892 transitions. [2022-11-02 21:04:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 21:04:39,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:39,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:39,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:04:39,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1890375133, now seen corresponding path program 1 times [2022-11-02 21:04:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:39,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497481944] [2022-11-02 21:04:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:04:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:04:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:04:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:39,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:39,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497481944] [2022-11-02 21:04:39,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497481944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:39,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:39,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857911778] [2022-11-02 21:04:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:39,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:39,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:39,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:39,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:39,997 INFO L87 Difference]: Start difference. First operand 533 states and 892 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:04:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:46,181 INFO L93 Difference]: Finished difference Result 1210 states and 2051 transitions. [2022-11-02 21:04:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:04:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-11-02 21:04:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:46,190 INFO L225 Difference]: With dead ends: 1210 [2022-11-02 21:04:46,191 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 21:04:46,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:04:46,195 INFO L413 NwaCegarLoop]: 831 mSDtfsCounter, 654 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:46,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1672 Invalid, 2375 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [136 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-02 21:04:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 21:04:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2022-11-02 21:04:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.7) internal successors, (714), 441 states have internal predecessors, (714), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:04:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 891 transitions. [2022-11-02 21:04:46,384 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 891 transitions. Word has length 59 [2022-11-02 21:04:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:46,386 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 891 transitions. [2022-11-02 21:04:46,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:04:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 891 transitions. [2022-11-02 21:04:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 21:04:46,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:46,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:46,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:04:46,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:46,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2145122521, now seen corresponding path program 1 times [2022-11-02 21:04:46,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624719480] [2022-11-02 21:04:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:04:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:04:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 21:04:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:46,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624719480] [2022-11-02 21:04:46,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624719480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:46,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:46,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:46,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009258759] [2022-11-02 21:04:46,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:46,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:46,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:46,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:46,937 INFO L87 Difference]: Start difference. First operand 533 states and 891 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:04:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:52,253 INFO L93 Difference]: Finished difference Result 1210 states and 2050 transitions. [2022-11-02 21:04:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:04:52,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-11-02 21:04:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:52,261 INFO L225 Difference]: With dead ends: 1210 [2022-11-02 21:04:52,261 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 21:04:52,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:04:52,266 INFO L413 NwaCegarLoop]: 831 mSDtfsCounter, 1076 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:52,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1663 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-02 21:04:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 21:04:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2022-11-02 21:04:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6976190476190476) internal successors, (713), 441 states have internal predecessors, (713), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:04:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 890 transitions. [2022-11-02 21:04:52,369 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 890 transitions. Word has length 60 [2022-11-02 21:04:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:52,370 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 890 transitions. [2022-11-02 21:04:52,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:04:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 890 transitions. [2022-11-02 21:04:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 21:04:52,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:52,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:52,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:04:52,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:52,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:52,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1890778849, now seen corresponding path program 1 times [2022-11-02 21:04:52,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:52,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419871707] [2022-11-02 21:04:52,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:52,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:04:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:04:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:04:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:52,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:52,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419871707] [2022-11-02 21:04:52,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419871707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:52,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:52,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171405432] [2022-11-02 21:04:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:52,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:52,899 INFO L87 Difference]: Start difference. First operand 533 states and 890 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:04:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:58,937 INFO L93 Difference]: Finished difference Result 1210 states and 2049 transitions. [2022-11-02 21:04:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:04:58,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-11-02 21:04:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:58,944 INFO L225 Difference]: With dead ends: 1210 [2022-11-02 21:04:58,944 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 21:04:58,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:04:58,948 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 648 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:58,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1656 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-02 21:04:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 21:04:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2022-11-02 21:04:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6952380952380952) internal successors, (712), 441 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:04:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 889 transitions. [2022-11-02 21:04:59,064 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 889 transitions. Word has length 61 [2022-11-02 21:04:59,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:59,066 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 889 transitions. [2022-11-02 21:04:59,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:04:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 889 transitions. [2022-11-02 21:04:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:04:59,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:59,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:59,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:04:59,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1260485795, now seen corresponding path program 1 times [2022-11-02 21:04:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:59,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066551154] [2022-11-02 21:04:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:59,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:04:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:59,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:04:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:04:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:59,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:04:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:59,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066551154] [2022-11-02 21:04:59,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066551154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:59,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:59,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421158068] [2022-11-02 21:04:59,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:59,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:59,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:59,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:59,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:59,581 INFO L87 Difference]: Start difference. First operand 533 states and 889 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:05,405 INFO L93 Difference]: Finished difference Result 1210 states and 2048 transitions. [2022-11-02 21:05:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:05:05,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2022-11-02 21:05:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:05,411 INFO L225 Difference]: With dead ends: 1210 [2022-11-02 21:05:05,411 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 21:05:05,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:05,415 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 645 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:05,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1682 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-02 21:05:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 21:05:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2022-11-02 21:05:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6928571428571428) internal successors, (711), 441 states have internal predecessors, (711), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 888 transitions. [2022-11-02 21:05:05,515 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 888 transitions. Word has length 62 [2022-11-02 21:05:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:05,516 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 888 transitions. [2022-11-02 21:05:05,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 888 transitions. [2022-11-02 21:05:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:05:05,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:05,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:05,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:05:05,519 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1456327238, now seen corresponding path program 1 times [2022-11-02 21:05:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:05,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695257953] [2022-11-02 21:05:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:05,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:05:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:05,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695257953] [2022-11-02 21:05:05,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695257953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:05,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:05,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:05,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290963143] [2022-11-02 21:05:05,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:05,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:05,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:05,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:05,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:05,985 INFO L87 Difference]: Start difference. First operand 533 states and 888 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:10,935 INFO L93 Difference]: Finished difference Result 1170 states and 1972 transitions. [2022-11-02 21:05:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2022-11-02 21:05:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:10,940 INFO L225 Difference]: With dead ends: 1170 [2022-11-02 21:05:10,940 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 21:05:10,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:10,944 INFO L413 NwaCegarLoop]: 770 mSDtfsCounter, 1135 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:10,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1576 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 21:05:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 21:05:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2022-11-02 21:05:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.680952380952381) internal successors, (706), 441 states have internal predecessors, (706), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 883 transitions. [2022-11-02 21:05:11,042 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 883 transitions. Word has length 63 [2022-11-02 21:05:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:11,043 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 883 transitions. [2022-11-02 21:05:11,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 883 transitions. [2022-11-02 21:05:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:05:11,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:11,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:11,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:05:11,046 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 53797837, now seen corresponding path program 1 times [2022-11-02 21:05:11,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:11,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056557186] [2022-11-02 21:05:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:05:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:11,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:11,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:11,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056557186] [2022-11-02 21:05:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056557186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:11,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:11,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743901695] [2022-11-02 21:05:11,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:11,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:11,533 INFO L87 Difference]: Start difference. First operand 533 states and 883 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:16,588 INFO L93 Difference]: Finished difference Result 1170 states and 1967 transitions. [2022-11-02 21:05:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:16,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2022-11-02 21:05:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:16,595 INFO L225 Difference]: With dead ends: 1170 [2022-11-02 21:05:16,596 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 21:05:16,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:16,603 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 1134 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:16,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1581 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-02 21:05:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 21:05:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2022-11-02 21:05:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6690476190476191) internal successors, (701), 441 states have internal predecessors, (701), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 878 transitions. [2022-11-02 21:05:16,712 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 878 transitions. Word has length 64 [2022-11-02 21:05:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 878 transitions. [2022-11-02 21:05:16,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 878 transitions. [2022-11-02 21:05:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:05:16,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:16,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:16,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:05:16,715 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash -695415713, now seen corresponding path program 1 times [2022-11-02 21:05:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:16,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986220246] [2022-11-02 21:05:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:16,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:05:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:17,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986220246] [2022-11-02 21:05:17,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986220246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:17,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:17,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:17,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603097468] [2022-11-02 21:05:17,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:17,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:17,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:17,181 INFO L87 Difference]: Start difference. First operand 533 states and 878 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:22,747 INFO L93 Difference]: Finished difference Result 1170 states and 1962 transitions. [2022-11-02 21:05:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:22,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2022-11-02 21:05:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:22,755 INFO L225 Difference]: With dead ends: 1170 [2022-11-02 21:05:22,756 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 21:05:22,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:22,759 INFO L413 NwaCegarLoop]: 781 mSDtfsCounter, 720 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:22,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1604 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 21:05:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 21:05:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2022-11-02 21:05:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6571428571428573) internal successors, (696), 441 states have internal predecessors, (696), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 873 transitions. [2022-11-02 21:05:22,863 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 873 transitions. Word has length 65 [2022-11-02 21:05:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:22,863 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 873 transitions. [2022-11-02 21:05:22,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 873 transitions. [2022-11-02 21:05:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:05:22,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:22,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:22,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:05:22,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1447465613, now seen corresponding path program 1 times [2022-11-02 21:05:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:22,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346077169] [2022-11-02 21:05:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:23,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:23,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:23,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:05:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:23,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346077169] [2022-11-02 21:05:23,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346077169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:23,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:23,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275426552] [2022-11-02 21:05:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:23,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:23,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:23,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:23,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:23,356 INFO L87 Difference]: Start difference. First operand 533 states and 873 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:29,085 INFO L93 Difference]: Finished difference Result 1185 states and 1977 transitions. [2022-11-02 21:05:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-11-02 21:05:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:29,090 INFO L225 Difference]: With dead ends: 1185 [2022-11-02 21:05:29,091 INFO L226 Difference]: Without dead ends: 716 [2022-11-02 21:05:29,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:05:29,093 INFO L413 NwaCegarLoop]: 791 mSDtfsCounter, 720 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:29,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1598 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-02 21:05:29,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-11-02 21:05:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 535. [2022-11-02 21:05:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 422 states have (on average 1.6540284360189574) internal successors, (698), 443 states have internal predecessors, (698), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 875 transitions. [2022-11-02 21:05:29,197 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 875 transitions. Word has length 66 [2022-11-02 21:05:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:29,198 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 875 transitions. [2022-11-02 21:05:29,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 875 transitions. [2022-11-02 21:05:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:05:29,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:29,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:29,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:05:29,201 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1530317394, now seen corresponding path program 1 times [2022-11-02 21:05:29,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:29,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742864495] [2022-11-02 21:05:29,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:29,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:05:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:29,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742864495] [2022-11-02 21:05:29,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742864495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:29,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:29,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711128428] [2022-11-02 21:05:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:29,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:29,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:29,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:29,624 INFO L87 Difference]: Start difference. First operand 535 states and 875 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:35,401 INFO L93 Difference]: Finished difference Result 1176 states and 1963 transitions. [2022-11-02 21:05:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:35,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-11-02 21:05:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:35,405 INFO L225 Difference]: With dead ends: 1176 [2022-11-02 21:05:35,405 INFO L226 Difference]: Without dead ends: 699 [2022-11-02 21:05:35,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:35,413 INFO L413 NwaCegarLoop]: 770 mSDtfsCounter, 718 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:35,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1574 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-02 21:05:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-11-02 21:05:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 535. [2022-11-02 21:05:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 422 states have (on average 1.6421800947867298) internal successors, (693), 443 states have internal predecessors, (693), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 870 transitions. [2022-11-02 21:05:35,524 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 870 transitions. Word has length 66 [2022-11-02 21:05:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:35,525 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 870 transitions. [2022-11-02 21:05:35,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 870 transitions. [2022-11-02 21:05:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 21:05:35,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:35,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:35,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:05:35,528 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash -236840319, now seen corresponding path program 1 times [2022-11-02 21:05:35,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:35,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492098978] [2022-11-02 21:05:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:35,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:05:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:36,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:36,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492098978] [2022-11-02 21:05:36,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492098978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:36,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:36,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:36,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078252989] [2022-11-02 21:05:36,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:36,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:36,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:36,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:36,007 INFO L87 Difference]: Start difference. First operand 535 states and 870 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:41,453 INFO L93 Difference]: Finished difference Result 1189 states and 1974 transitions. [2022-11-02 21:05:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:41,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2022-11-02 21:05:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:41,459 INFO L225 Difference]: With dead ends: 1189 [2022-11-02 21:05:41,459 INFO L226 Difference]: Without dead ends: 720 [2022-11-02 21:05:41,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:05:41,462 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 1152 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:41,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 1585 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-02 21:05:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-11-02 21:05:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 538. [2022-11-02 21:05:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 425 states have (on average 1.6376470588235295) internal successors, (696), 446 states have internal predecessors, (696), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 873 transitions. [2022-11-02 21:05:41,577 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 873 transitions. Word has length 67 [2022-11-02 21:05:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:41,577 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 873 transitions. [2022-11-02 21:05:41,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 873 transitions. [2022-11-02 21:05:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 21:05:41,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:41,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:41,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:05:41,580 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1490116356, now seen corresponding path program 1 times [2022-11-02 21:05:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:41,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670318818] [2022-11-02 21:05:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:42,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:05:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:42,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:42,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670318818] [2022-11-02 21:05:42,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670318818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:42,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:42,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:42,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134809320] [2022-11-02 21:05:42,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:42,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:42,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:42,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:42,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:42,058 INFO L87 Difference]: Start difference. First operand 538 states and 873 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:47,561 INFO L93 Difference]: Finished difference Result 1185 states and 1967 transitions. [2022-11-02 21:05:47,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:47,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2022-11-02 21:05:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:47,566 INFO L225 Difference]: With dead ends: 1185 [2022-11-02 21:05:47,566 INFO L226 Difference]: Without dead ends: 705 [2022-11-02 21:05:47,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:47,569 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 717 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:47,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1590 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-02 21:05:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-11-02 21:05:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 538. [2022-11-02 21:05:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 425 states have (on average 1.6258823529411766) internal successors, (691), 446 states have internal predecessors, (691), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 868 transitions. [2022-11-02 21:05:47,692 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 868 transitions. Word has length 67 [2022-11-02 21:05:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:47,692 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 868 transitions. [2022-11-02 21:05:47,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 868 transitions. [2022-11-02 21:05:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 21:05:47,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:47,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:47,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:05:47,695 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 286666936, now seen corresponding path program 1 times [2022-11-02 21:05:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628270407] [2022-11-02 21:05:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:47,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:05:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:48,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:48,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628270407] [2022-11-02 21:05:48,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628270407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:48,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:48,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391972709] [2022-11-02 21:05:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:48,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:48,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:48,208 INFO L87 Difference]: Start difference. First operand 538 states and 868 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:53,575 INFO L93 Difference]: Finished difference Result 1195 states and 1973 transitions. [2022-11-02 21:05:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:53,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-11-02 21:05:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:53,580 INFO L225 Difference]: With dead ends: 1195 [2022-11-02 21:05:53,580 INFO L226 Difference]: Without dead ends: 726 [2022-11-02 21:05:53,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:05:53,583 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1136 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:53,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 1615 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 21:05:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-11-02 21:05:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 542. [2022-11-02 21:05:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.6200466200466201) internal successors, (695), 450 states have internal predecessors, (695), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 872 transitions. [2022-11-02 21:05:53,675 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 872 transitions. Word has length 68 [2022-11-02 21:05:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:53,675 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 872 transitions. [2022-11-02 21:05:53,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 872 transitions. [2022-11-02 21:05:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 21:05:53,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:53,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:53,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:05:53,678 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash -74566441, now seen corresponding path program 1 times [2022-11-02 21:05:53,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:53,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317058388] [2022-11-02 21:05:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:54,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:05:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:54,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:54,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317058388] [2022-11-02 21:05:54,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317058388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:54,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:54,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991642455] [2022-11-02 21:05:54,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:54,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:54,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:54,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:54,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:54,145 INFO L87 Difference]: Start difference. First operand 542 states and 872 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:59,303 INFO L93 Difference]: Finished difference Result 1237 states and 2024 transitions. [2022-11-02 21:05:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:05:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-11-02 21:05:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:59,307 INFO L225 Difference]: With dead ends: 1237 [2022-11-02 21:05:59,308 INFO L226 Difference]: Without dead ends: 713 [2022-11-02 21:05:59,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:59,311 INFO L413 NwaCegarLoop]: 801 mSDtfsCounter, 1061 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:59,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1625 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 21:05:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-02 21:05:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 542. [2022-11-02 21:05:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.6177156177156178) internal successors, (694), 450 states have internal predecessors, (694), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:05:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 871 transitions. [2022-11-02 21:05:59,437 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 871 transitions. Word has length 68 [2022-11-02 21:05:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:59,437 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 871 transitions. [2022-11-02 21:05:59,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:05:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 871 transitions. [2022-11-02 21:05:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 21:05:59,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:59,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:59,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:05:59,440 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1207757034, now seen corresponding path program 1 times [2022-11-02 21:05:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:59,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593741407] [2022-11-02 21:05:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:59,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:05:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:00,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:06:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:00,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:00,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593741407] [2022-11-02 21:06:00,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593741407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:00,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:00,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 21:06:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671167772] [2022-11-02 21:06:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:00,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:06:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:00,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:06:00,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:06:00,037 INFO L87 Difference]: Start difference. First operand 542 states and 871 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 21:06:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:08,142 INFO L93 Difference]: Finished difference Result 1193 states and 1968 transitions. [2022-11-02 21:06:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:06:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2022-11-02 21:06:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:08,148 INFO L225 Difference]: With dead ends: 1193 [2022-11-02 21:06:08,148 INFO L226 Difference]: Without dead ends: 703 [2022-11-02 21:06:08,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:06:08,151 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 748 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 5680 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 3081 SdHoareTripleChecker+Invalid, 5827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 5680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:08,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 3081 Invalid, 5827 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [147 Valid, 5680 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-02 21:06:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-11-02 21:06:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 534. [2022-11-02 21:06:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 421 states have (on average 1.6223277909738718) internal successors, (683), 442 states have internal predecessors, (683), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:06:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 860 transitions. [2022-11-02 21:06:08,270 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 860 transitions. Word has length 68 [2022-11-02 21:06:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:08,271 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 860 transitions. [2022-11-02 21:06:08,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 21:06:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 860 transitions. [2022-11-02 21:06:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 21:06:08,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:08,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:08,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:06:08,274 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:08,274 INFO L85 PathProgramCache]: Analyzing trace with hash 215181447, now seen corresponding path program 1 times [2022-11-02 21:06:08,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:08,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168689597] [2022-11-02 21:06:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:08,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:08,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:06:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:06:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:08,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:08,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:08,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168689597] [2022-11-02 21:06:08,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168689597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:08,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:08,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:06:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939459245] [2022-11-02 21:06:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:08,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:06:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:06:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:06:08,828 INFO L87 Difference]: Start difference. First operand 534 states and 860 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 21:06:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:16,048 INFO L93 Difference]: Finished difference Result 1193 states and 1964 transitions. [2022-11-02 21:06:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:06:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2022-11-02 21:06:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:16,051 INFO L225 Difference]: With dead ends: 1193 [2022-11-02 21:06:16,052 INFO L226 Difference]: Without dead ends: 724 [2022-11-02 21:06:16,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:06:16,053 INFO L413 NwaCegarLoop]: 788 mSDtfsCounter, 689 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 4330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:16,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 2557 Invalid, 4330 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [144 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-02 21:06:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-11-02 21:06:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 539. [2022-11-02 21:06:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 426 states have (on average 1.6150234741784038) internal successors, (688), 447 states have internal predecessors, (688), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:06:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 865 transitions. [2022-11-02 21:06:16,157 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 865 transitions. Word has length 69 [2022-11-02 21:06:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:16,157 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 865 transitions. [2022-11-02 21:06:16,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 21:06:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 865 transitions. [2022-11-02 21:06:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 21:06:16,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:16,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:16,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:06:16,160 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1063227830, now seen corresponding path program 1 times [2022-11-02 21:06:16,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:16,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055942427] [2022-11-02 21:06:16,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:06:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:06:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:16,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:16,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055942427] [2022-11-02 21:06:16,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055942427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:16,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:16,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:06:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274140494] [2022-11-02 21:06:16,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:16,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:16,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:16,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:16,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:16,618 INFO L87 Difference]: Start difference. First operand 539 states and 865 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:06:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:22,162 INFO L93 Difference]: Finished difference Result 1191 states and 1959 transitions. [2022-11-02 21:06:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:06:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-11-02 21:06:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:22,167 INFO L225 Difference]: With dead ends: 1191 [2022-11-02 21:06:22,167 INFO L226 Difference]: Without dead ends: 701 [2022-11-02 21:06:22,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:06:22,169 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 684 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:22,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1588 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-02 21:06:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-11-02 21:06:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 539. [2022-11-02 21:06:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 426 states have (on average 1.6056338028169015) internal successors, (684), 447 states have internal predecessors, (684), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 21:06:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 861 transitions. [2022-11-02 21:06:22,266 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 861 transitions. Word has length 70 [2022-11-02 21:06:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:22,266 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 861 transitions. [2022-11-02 21:06:22,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 21:06:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 861 transitions. [2022-11-02 21:06:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 21:06:22,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:22,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:22,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:06:22,270 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 308579468, now seen corresponding path program 1 times [2022-11-02 21:06:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:22,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466249073] [2022-11-02 21:06:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:06:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:06:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:22,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466249073] [2022-11-02 21:06:22,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466249073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:22,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:22,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:06:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265286803] [2022-11-02 21:06:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:22,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:06:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:06:22,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:06:22,978 INFO L87 Difference]: Start difference. First operand 539 states and 861 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 21:06:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:33,598 INFO L93 Difference]: Finished difference Result 1959 states and 3314 transitions. [2022-11-02 21:06:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:06:33,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2022-11-02 21:06:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:33,608 INFO L225 Difference]: With dead ends: 1959 [2022-11-02 21:06:33,609 INFO L226 Difference]: Without dead ends: 1498 [2022-11-02 21:06:33,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:06:33,611 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 4192 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 1253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4274 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 4258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1253 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:33,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4274 Valid, 1963 Invalid, 4258 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1253 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-11-02 21:06:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2022-11-02 21:06:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1021. [2022-11-02 21:06:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 809 states have (on average 1.6489493201483312) internal successors, (1334), 839 states have internal predecessors, (1334), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2022-11-02 21:06:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1684 transitions. [2022-11-02 21:06:33,897 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1684 transitions. Word has length 70 [2022-11-02 21:06:33,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:33,897 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 1684 transitions. [2022-11-02 21:06:33,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 21:06:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1684 transitions. [2022-11-02 21:06:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 21:06:33,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:33,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:33,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:06:33,902 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash -806032662, now seen corresponding path program 1 times [2022-11-02 21:06:33,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:33,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165171759] [2022-11-02 21:06:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:06:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:06:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:35,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:06:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:35,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:06:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:35,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165171759] [2022-11-02 21:06:35,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165171759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:35,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:35,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:06:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513687760] [2022-11-02 21:06:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:35,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:06:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:06:35,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:06:35,076 INFO L87 Difference]: Start difference. First operand 1021 states and 1684 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-02 21:06:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:43,111 INFO L93 Difference]: Finished difference Result 2478 states and 4193 transitions. [2022-11-02 21:06:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:06:43,114 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 99 [2022-11-02 21:06:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:43,123 INFO L225 Difference]: With dead ends: 2478 [2022-11-02 21:06:43,124 INFO L226 Difference]: Without dead ends: 1536 [2022-11-02 21:06:43,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:06:43,128 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 2813 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2813 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:43,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2813 Valid, 2431 Invalid, 4280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1046 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 21:06:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2022-11-02 21:06:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1029. [2022-11-02 21:06:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 815 states have (on average 1.6441717791411044) internal successors, (1340), 845 states have internal predecessors, (1340), 174 states have call successors, (174), 36 states have call predecessors, (174), 39 states have return successors, (180), 160 states have call predecessors, (180), 169 states have call successors, (180) [2022-11-02 21:06:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1694 transitions. [2022-11-02 21:06:43,375 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1694 transitions. Word has length 99 [2022-11-02 21:06:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:43,375 INFO L495 AbstractCegarLoop]: Abstraction has 1029 states and 1694 transitions. [2022-11-02 21:06:43,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-02 21:06:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1694 transitions. [2022-11-02 21:06:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-02 21:06:43,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:43,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:43,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:06:43,380 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -350500354, now seen corresponding path program 1 times [2022-11-02 21:06:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:43,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010478093] [2022-11-02 21:06:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:43,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:43,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:06:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:06:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:44,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:44,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:06:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:06:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:06:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010478093] [2022-11-02 21:06:44,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010478093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:44,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:44,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-02 21:06:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185760390] [2022-11-02 21:06:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:44,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 21:06:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:44,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 21:06:44,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:06:44,478 INFO L87 Difference]: Start difference. First operand 1029 states and 1694 transitions. Second operand has 18 states, 17 states have (on average 4.764705882352941) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-02 21:07:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:26,374 INFO L93 Difference]: Finished difference Result 6634 states and 11771 transitions. [2022-11-02 21:07:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-02 21:07:26,375 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.764705882352941) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 102 [2022-11-02 21:07:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:26,421 INFO L225 Difference]: With dead ends: 6634 [2022-11-02 21:07:26,421 INFO L226 Difference]: Without dead ends: 5679 [2022-11-02 21:07:26,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2544 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1160, Invalid=6496, Unknown=0, NotChecked=0, Total=7656 [2022-11-02 21:07:26,436 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 7543 mSDsluCounter, 5347 mSDsCounter, 0 mSdLazyCounter, 18418 mSolverCounterSat, 4382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7555 SdHoareTripleChecker+Valid, 6511 SdHoareTripleChecker+Invalid, 22800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4382 IncrementalHoareTripleChecker+Valid, 18418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:26,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7555 Valid, 6511 Invalid, 22800 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4382 Valid, 18418 Invalid, 0 Unknown, 0 Unchecked, 27.2s Time] [2022-11-02 21:07:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2022-11-02 21:07:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 3849. [2022-11-02 21:07:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3017 states have (on average 1.6125290023201857) internal successors, (4865), 3105 states have internal predecessors, (4865), 667 states have call successors, (667), 132 states have call predecessors, (667), 164 states have return successors, (872), 644 states have call predecessors, (872), 662 states have call successors, (872) [2022-11-02 21:07:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 6404 transitions. [2022-11-02 21:07:27,847 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 6404 transitions. Word has length 102 [2022-11-02 21:07:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:27,848 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 6404 transitions. [2022-11-02 21:07:27,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.764705882352941) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-02 21:07:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 6404 transitions. [2022-11-02 21:07:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 21:07:27,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:27,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:27,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:07:27,853 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:27,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash -773449746, now seen corresponding path program 1 times [2022-11-02 21:07:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:27,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205599807] [2022-11-02 21:07:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:07:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:07:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:07:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:07:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:07:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:07:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:29,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205599807] [2022-11-02 21:07:29,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205599807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:29,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:29,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-02 21:07:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407294924] [2022-11-02 21:07:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:29,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 21:07:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 21:07:29,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:07:29,230 INFO L87 Difference]: Start difference. First operand 3849 states and 6404 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 14 states have internal predecessors, (88), 7 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11)