./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/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_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/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_bb887d6a-2752-4e15-842e-757c98243a58/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 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a --- 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:10:57,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:10:57,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:10:57,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:10:57,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:10:57,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:10:57,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:10:57,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:10:57,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:10:57,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:10:57,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:10:57,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:10:57,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:10:57,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:10:57,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:10:57,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:10:57,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:10:57,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:10:57,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:10:57,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:10:57,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:10:57,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:10:57,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:10:57,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:10:57,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:10:57,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:10:57,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:10:57,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:10:57,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:10:57,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:10:57,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:10:57,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:10:57,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:10:57,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:10:57,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:10:57,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:10:57,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:10:57,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:10:57,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:10:57,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:10:57,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:10:57,521 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:10:57,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:10:57,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:10:57,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:10:57,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:10:57,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:10:57,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:10:57,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:10:57,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:10:57,581 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:10:57,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:10:57,583 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:10:57,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:10:57,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:10:57,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:10:57,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:10:57,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:10:57,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:10:57,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:10:57,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:10:57,586 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:10:57,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:10:57,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:10:57,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:10:57,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:10:57,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:10:57,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:10:57,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:10:57,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:10:57,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:10:57,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:10:57,588 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:10:57,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:10:57,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:10:57,589 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_bb887d6a-2752-4e15-842e-757c98243a58/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_bb887d6a-2752-4e15-842e-757c98243a58/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 -> 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a [2022-11-02 21:10:57,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:10:57,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:10:57,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:10:57,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:10:57,986 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:10:57,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2022-11-02 21:10:58,071 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/data/9ee958e4f/18543beab84e4f4aa07eef630c05e00f/FLAGc5f680b96 [2022-11-02 21:10:58,959 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:10:58,960 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2022-11-02 21:10:58,995 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/data/9ee958e4f/18543beab84e4f4aa07eef630c05e00f/FLAGc5f680b96 [2022-11-02 21:10:59,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/data/9ee958e4f/18543beab84e4f4aa07eef630c05e00f [2022-11-02 21:10:59,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:10:59,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:10:59,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:10:59,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:10:59,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:10:59,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:10:59" (1/1) ... [2022-11-02 21:10:59,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570256fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:59, skipping insertion in model container [2022-11-02 21:10:59,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:10:59" (1/1) ... [2022-11-02 21:10:59,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:10:59,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:10:59,716 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_bb887d6a-2752-4e15-842e-757c98243a58/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c[23488,23501] [2022-11-02 21:10:59,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:10:59,965 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:11:00,052 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_bb887d6a-2752-4e15-842e-757c98243a58/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c[23488,23501] [2022-11-02 21:11:00,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:00,133 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:11:00,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00 WrapperNode [2022-11-02 21:11:00,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:00,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:00,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:11:00,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:11:00,152 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:11:00" (1/1) ... [2022-11-02 21:11:00,195 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:11:00" (1/1) ... [2022-11-02 21:11:00,276 INFO L138 Inliner]: procedures = 91, calls = 331, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 805 [2022-11-02 21:11:00,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:00,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:11:00,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:11:00,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:11:00,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,355 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:11:00,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:11:00,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:11:00,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:11:00,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (1/1) ... [2022-11-02 21:11:00,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:00,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:00,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:11:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:11:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2022-11-02 21:11:00,529 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2022-11-02 21:11:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2022-11-02 21:11:00,530 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2022-11-02 21:11:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2022-11-02 21:11:00,530 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2022-11-02 21:11:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2022-11-02 21:11:00,534 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2022-11-02 21:11:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2022-11-02 21:11:00,534 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2022-11-02 21:11:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-11-02 21:11:00,535 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-11-02 21:11:00,535 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-11-02 21:11:00,535 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-11-02 21:11:00,535 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2022-11-02 21:11:00,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2022-11-02 21:11:00,536 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2022-11-02 21:11:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2022-11-02 21:11:00,536 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2022-11-02 21:11:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2022-11-02 21:11:00,537 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2022-11-02 21:11:00,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2022-11-02 21:11:00,537 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2022-11-02 21:11:00,537 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2022-11-02 21:11:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2022-11-02 21:11:00,538 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2022-11-02 21:11:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2022-11-02 21:11:00,538 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2022-11-02 21:11:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2022-11-02 21:11:00,539 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2022-11-02 21:11:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2022-11-02 21:11:00,539 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2022-11-02 21:11:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2022-11-02 21:11:00,540 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2022-11-02 21:11:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:11:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2022-11-02 21:11:00,541 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2022-11-02 21:11:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2022-11-02 21:11:00,541 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2022-11-02 21:11:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2022-11-02 21:11:00,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2022-11-02 21:11:00,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:11:00,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:11:00,543 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2022-11-02 21:11:00,544 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2022-11-02 21:11:00,789 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:11:00,792 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:11:02,350 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:11:02,375 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:11:02,375 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:11:02,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:02 BoogieIcfgContainer [2022-11-02 21:11:02,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:11:02,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:11:02,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:11:02,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:11:02,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:10:59" (1/3) ... [2022-11-02 21:11:02,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738ec235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:02, skipping insertion in model container [2022-11-02 21:11:02,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:00" (2/3) ... [2022-11-02 21:11:02,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738ec235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:02, skipping insertion in model container [2022-11-02 21:11:02,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:02" (3/3) ... [2022-11-02 21:11:02,392 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2022-11-02 21:11:02,415 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:11:02,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:11:02,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:11:02,501 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;@b627380, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:11:02,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:11:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 532 states, 424 states have (on average 1.7146226415094339) internal successors, (727), 445 states have internal predecessors, (727), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2022-11-02 21:11:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 21:11:02,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:02,542 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] [2022-11-02 21:11:02,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash -681820971, now seen corresponding path program 1 times [2022-11-02 21:11:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:02,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245329068] [2022-11-02 21:11:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:02,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:11:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:11:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 21:11:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:04,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:04,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:11:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:04,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:11:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:04,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:11:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:04,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245329068] [2022-11-02 21:11:04,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245329068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:04,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:04,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:11:04,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730587356] [2022-11-02 21:11:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:04,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:04,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:04,463 INFO L87 Difference]: Start difference. First operand has 532 states, 424 states have (on average 1.7146226415094339) internal successors, (727), 445 states have internal predecessors, (727), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:11:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:17,351 INFO L93 Difference]: Finished difference Result 1464 states and 2544 transitions. [2022-11-02 21:11:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:11:17,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2022-11-02 21:11:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:17,385 INFO L225 Difference]: With dead ends: 1464 [2022-11-02 21:11:17,385 INFO L226 Difference]: Without dead ends: 944 [2022-11-02 21:11:17,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:11:17,402 INFO L413 NwaCegarLoop]: 914 mSDtfsCounter, 1439 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 4418 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 5100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 4418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:17,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 2999 Invalid, 5100 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [682 Valid, 4418 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-11-02 21:11:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-11-02 21:11:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 526. [2022-11-02 21:11:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 420 states have (on average 1.707142857142857) internal successors, (717), 439 states have internal predecessors, (717), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-02 21:11:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 882 transitions. [2022-11-02 21:11:17,682 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 882 transitions. Word has length 76 [2022-11-02 21:11:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:17,683 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 882 transitions. [2022-11-02 21:11:17,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:11:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 882 transitions. [2022-11-02 21:11:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 21:11:17,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:17,691 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] [2022-11-02 21:11:17,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:11:17,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 620960083, now seen corresponding path program 1 times [2022-11-02 21:11:17,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:17,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965888300] [2022-11-02 21:11:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:17,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:11:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:11:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:11:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:18,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:11:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:11:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:11:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:18,465 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:11:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:18,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965888300] [2022-11-02 21:11:18,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965888300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:18,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:18,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:11:18,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454439636] [2022-11-02 21:11:18,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:18,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:11:18,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:18,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:11:18,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:11:18,473 INFO L87 Difference]: Start difference. First operand 526 states and 882 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:11:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:27,949 INFO L93 Difference]: Finished difference Result 1299 states and 2213 transitions. [2022-11-02 21:11:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:11:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2022-11-02 21:11:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:27,965 INFO L225 Difference]: With dead ends: 1299 [2022-11-02 21:11:27,966 INFO L226 Difference]: Without dead ends: 791 [2022-11-02 21:11:27,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:11:27,978 INFO L413 NwaCegarLoop]: 934 mSDtfsCounter, 1839 mSDsluCounter, 2617 mSDsCounter, 0 mSdLazyCounter, 4620 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 3551 SdHoareTripleChecker+Invalid, 5167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 4620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:27,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 3551 Invalid, 5167 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [547 Valid, 4620 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-02 21:11:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-02 21:11:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 530. [2022-11-02 21:11:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 423 states have (on average 1.6997635933806146) internal successors, (719), 442 states have internal predecessors, (719), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (82), 79 states have call predecessors, (82), 80 states have call successors, (82) [2022-11-02 21:11:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 886 transitions. [2022-11-02 21:11:28,210 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 886 transitions. Word has length 82 [2022-11-02 21:11:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:28,213 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 886 transitions. [2022-11-02 21:11:28,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:11:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 886 transitions. [2022-11-02 21:11:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-02 21:11:28,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:28,231 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] [2022-11-02 21:11:28,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:11:28,232 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 479075021, now seen corresponding path program 1 times [2022-11-02 21:11:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:28,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226023387] [2022-11-02 21:11:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:11:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 21:11:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:11:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:11:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:11:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:29,007 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:11:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:29,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226023387] [2022-11-02 21:11:29,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226023387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:29,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:29,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 21:11:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442054347] [2022-11-02 21:11:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:29,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:11:29,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:29,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:11:29,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:11:29,014 INFO L87 Difference]: Start difference. First operand 530 states and 886 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 21:11:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:51,370 INFO L93 Difference]: Finished difference Result 2420 states and 4264 transitions. [2022-11-02 21:11:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 21:11:51,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 87 [2022-11-02 21:11:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:51,390 INFO L225 Difference]: With dead ends: 2420 [2022-11-02 21:11:51,390 INFO L226 Difference]: Without dead ends: 1908 [2022-11-02 21:11:51,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2022-11-02 21:11:51,397 INFO L413 NwaCegarLoop]: 1013 mSDtfsCounter, 2955 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 8382 mSolverCounterSat, 1224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3025 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 9606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1224 IncrementalHoareTripleChecker+Valid, 8382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:51,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3025 Valid, 4553 Invalid, 9606 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1224 Valid, 8382 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2022-11-02 21:11:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2022-11-02 21:11:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1375. [2022-11-02 21:11:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1091 states have (on average 1.6608615948670944) internal successors, (1812), 1138 states have internal predecessors, (1812), 224 states have call successors, (224), 56 states have call predecessors, (224), 59 states have return successors, (258), 216 states have call predecessors, (258), 219 states have call successors, (258) [2022-11-02 21:11:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2294 transitions. [2022-11-02 21:11:51,847 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2294 transitions. Word has length 87 [2022-11-02 21:11:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:51,848 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 2294 transitions. [2022-11-02 21:11:51,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 21:11:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2294 transitions. [2022-11-02 21:11:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-02 21:11:51,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:51,853 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] [2022-11-02 21:11:51,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:11:51,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:51,854 INFO L85 PathProgramCache]: Analyzing trace with hash -245229541, now seen corresponding path program 1 times [2022-11-02 21:11:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:51,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597027253] [2022-11-02 21:11:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:51,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:11:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:11:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:11:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:11:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:11:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 21:11:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,844 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:11:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597027253] [2022-11-02 21:11:52,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597027253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:52,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:52,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:11:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530007692] [2022-11-02 21:11:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:52,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:11:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:52,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:11:52,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:11:52,850 INFO L87 Difference]: Start difference. First operand 1375 states and 2294 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 10 states have internal predecessors, (75), 4 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-02 21:12:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:09,993 INFO L93 Difference]: Finished difference Result 3513 states and 6016 transitions. [2022-11-02 21:12:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 21:12:09,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 10 states have internal predecessors, (75), 4 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 96 [2022-11-02 21:12:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:10,013 INFO L225 Difference]: With dead ends: 3513 [2022-11-02 21:12:10,014 INFO L226 Difference]: Without dead ends: 1982 [2022-11-02 21:12:10,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2022-11-02 21:12:10,026 INFO L413 NwaCegarLoop]: 897 mSDtfsCounter, 4132 mSDsluCounter, 3832 mSDsCounter, 0 mSdLazyCounter, 8294 mSolverCounterSat, 1108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4187 SdHoareTripleChecker+Valid, 4729 SdHoareTripleChecker+Invalid, 9402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1108 IncrementalHoareTripleChecker+Valid, 8294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:10,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4187 Valid, 4729 Invalid, 9402 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1108 Valid, 8294 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2022-11-02 21:12:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2022-11-02 21:12:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1450. [2022-11-02 21:12:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1149 states have (on average 1.6309834638816363) internal successors, (1874), 1198 states have internal predecessors, (1874), 236 states have call successors, (236), 61 states have call predecessors, (236), 64 states have return successors, (279), 226 states have call predecessors, (279), 231 states have call successors, (279) [2022-11-02 21:12:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2389 transitions. [2022-11-02 21:12:10,571 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2389 transitions. Word has length 96 [2022-11-02 21:12:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:10,571 INFO L495 AbstractCegarLoop]: Abstraction has 1450 states and 2389 transitions. [2022-11-02 21:12:10,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 10 states have internal predecessors, (75), 4 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-02 21:12:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2389 transitions. [2022-11-02 21:12:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 21:12:10,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:10,588 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:10,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:12:10,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -54702925, now seen corresponding path program 1 times [2022-11-02 21:12:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:10,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081607124] [2022-11-02 21:12:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:12:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:10,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:12:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:12:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:12:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:12:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:12:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:12:11,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:11,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081607124] [2022-11-02 21:12:11,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081607124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:11,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:11,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:12:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143688981] [2022-11-02 21:12:11,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:11,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:12:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:11,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:12:11,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:11,204 INFO L87 Difference]: Start difference. First operand 1450 states and 2389 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:12:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:18,015 INFO L93 Difference]: Finished difference Result 3392 states and 5718 transitions. [2022-11-02 21:12:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:12:18,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-11-02 21:12:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:18,034 INFO L225 Difference]: With dead ends: 3392 [2022-11-02 21:12:18,034 INFO L226 Difference]: Without dead ends: 1960 [2022-11-02 21:12:18,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:12:18,044 INFO L413 NwaCegarLoop]: 887 mSDtfsCounter, 1759 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:18,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1823 Valid, 2045 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-02 21:12:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2022-11-02 21:12:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1450. [2022-11-02 21:12:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1149 states have (on average 1.630113141862489) internal successors, (1873), 1198 states have internal predecessors, (1873), 236 states have call successors, (236), 61 states have call predecessors, (236), 64 states have return successors, (279), 226 states have call predecessors, (279), 231 states have call successors, (279) [2022-11-02 21:12:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2388 transitions. [2022-11-02 21:12:18,600 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2388 transitions. Word has length 99 [2022-11-02 21:12:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:18,600 INFO L495 AbstractCegarLoop]: Abstraction has 1450 states and 2388 transitions. [2022-11-02 21:12:18,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:12:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2388 transitions. [2022-11-02 21:12:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 21:12:18,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:18,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:18,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:12:18,608 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:18,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1292774038, now seen corresponding path program 1 times [2022-11-02 21:12:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:18,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333392942] [2022-11-02 21:12:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:18,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:12:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:18,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:12:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:12:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:12:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:12:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:12:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:12:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:19,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333392942] [2022-11-02 21:12:19,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333392942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:19,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:19,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:12:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367808105] [2022-11-02 21:12:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:19,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:12:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:12:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:12:19,441 INFO L87 Difference]: Start difference. First operand 1450 states and 2388 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:12:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:29,860 INFO L93 Difference]: Finished difference Result 3472 states and 5951 transitions. [2022-11-02 21:12:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:12:29,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2022-11-02 21:12:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:29,881 INFO L225 Difference]: With dead ends: 3472 [2022-11-02 21:12:29,882 INFO L226 Difference]: Without dead ends: 2080 [2022-11-02 21:12:29,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:12:29,893 INFO L413 NwaCegarLoop]: 879 mSDtfsCounter, 2032 mSDsluCounter, 3616 mSDsCounter, 0 mSdLazyCounter, 5920 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 6585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 5920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:29,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 4495 Invalid, 6585 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [665 Valid, 5920 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-11-02 21:12:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2022-11-02 21:12:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1474. [2022-11-02 21:12:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1161 states have (on average 1.6192937123169682) internal successors, (1880), 1218 states have internal predecessors, (1880), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:12:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2431 transitions. [2022-11-02 21:12:30,455 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2431 transitions. Word has length 100 [2022-11-02 21:12:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:30,456 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 2431 transitions. [2022-11-02 21:12:30,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:12:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2431 transitions. [2022-11-02 21:12:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:12:30,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:30,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:30,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:12:30,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash 271876460, now seen corresponding path program 1 times [2022-11-02 21:12:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:30,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452781851] [2022-11-02 21:12:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:12:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:30,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:12:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:30,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:12:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:30,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:12:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:12:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:31,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:12:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:12:31,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:31,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452781851] [2022-11-02 21:12:31,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452781851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:31,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:31,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:12:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465048996] [2022-11-02 21:12:31,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:31,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:12:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:12:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:31,037 INFO L87 Difference]: Start difference. First operand 1474 states and 2431 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:12:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:37,823 INFO L93 Difference]: Finished difference Result 3408 states and 5773 transitions. [2022-11-02 21:12:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:12:37,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2022-11-02 21:12:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:37,843 INFO L225 Difference]: With dead ends: 3408 [2022-11-02 21:12:37,844 INFO L226 Difference]: Without dead ends: 1992 [2022-11-02 21:12:37,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:12:37,855 INFO L413 NwaCegarLoop]: 841 mSDtfsCounter, 1386 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 2645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:37,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 2060 Invalid, 2645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-02 21:12:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-11-02 21:12:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1474. [2022-11-02 21:12:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1161 states have (on average 1.6149870801033592) internal successors, (1875), 1218 states have internal predecessors, (1875), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:12:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2426 transitions. [2022-11-02 21:12:38,474 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2426 transitions. Word has length 101 [2022-11-02 21:12:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:38,474 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 2426 transitions. [2022-11-02 21:12:38,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:12:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2426 transitions. [2022-11-02 21:12:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-02 21:12:38,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:38,480 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:38,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:12:38,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:38,482 INFO L85 PathProgramCache]: Analyzing trace with hash -186141934, now seen corresponding path program 1 times [2022-11-02 21:12:38,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:38,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246119278] [2022-11-02 21:12:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:38,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:12:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:12:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:12:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:12:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:12:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:12:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:12:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:39,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246119278] [2022-11-02 21:12:39,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246119278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:39,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:39,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:12:39,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296323175] [2022-11-02 21:12:39,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:39,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:12:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:39,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:12:39,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:39,082 INFO L87 Difference]: Start difference. First operand 1474 states and 2426 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:12:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:46,910 INFO L93 Difference]: Finished difference Result 3408 states and 5768 transitions. [2022-11-02 21:12:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:12:46,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2022-11-02 21:12:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:46,927 INFO L225 Difference]: With dead ends: 3408 [2022-11-02 21:12:46,927 INFO L226 Difference]: Without dead ends: 1992 [2022-11-02 21:12:46,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:12:46,937 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 965 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:46,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 2122 Invalid, 2677 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [292 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-11-02 21:12:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-11-02 21:12:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1474. [2022-11-02 21:12:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1161 states have (on average 1.6106804478897503) internal successors, (1870), 1218 states have internal predecessors, (1870), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:12:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2421 transitions. [2022-11-02 21:12:47,373 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2421 transitions. Word has length 102 [2022-11-02 21:12:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:47,374 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 2421 transitions. [2022-11-02 21:12:47,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:12:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2421 transitions. [2022-11-02 21:12:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 21:12:47,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:47,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:47,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:12:47,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash -250701561, now seen corresponding path program 1 times [2022-11-02 21:12:47,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:47,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343398839] [2022-11-02 21:12:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:12:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:12:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:12:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:12:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:12:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:12:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:12:47,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:47,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343398839] [2022-11-02 21:12:47,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343398839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:47,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:47,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:12:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340187461] [2022-11-02 21:12:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:47,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:12:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:12:47,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:47,966 INFO L87 Difference]: Start difference. First operand 1474 states and 2421 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:12:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:55,618 INFO L93 Difference]: Finished difference Result 3408 states and 5763 transitions. [2022-11-02 21:12:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:12:55,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2022-11-02 21:12:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:55,636 INFO L225 Difference]: With dead ends: 3408 [2022-11-02 21:12:55,637 INFO L226 Difference]: Without dead ends: 1992 [2022-11-02 21:12:55,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:12:55,646 INFO L413 NwaCegarLoop]: 839 mSDtfsCounter, 980 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:55,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 2121 Invalid, 2636 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [284 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-02 21:12:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-11-02 21:12:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1474. [2022-11-02 21:12:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1161 states have (on average 1.6063738156761413) internal successors, (1865), 1218 states have internal predecessors, (1865), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:12:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2416 transitions. [2022-11-02 21:12:56,270 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2416 transitions. Word has length 103 [2022-11-02 21:12:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:56,270 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 2416 transitions. [2022-11-02 21:12:56,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:12:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2416 transitions. [2022-11-02 21:12:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 21:12:56,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:56,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:56,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:12:56,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:56,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash 288097926, now seen corresponding path program 1 times [2022-11-02 21:12:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:56,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394743352] [2022-11-02 21:12:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:56,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:12:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:12:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:12:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:12:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:12:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:12:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:12:56,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:56,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394743352] [2022-11-02 21:12:56,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394743352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:56,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:56,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:12:56,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294179919] [2022-11-02 21:12:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:56,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:12:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:12:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:56,879 INFO L87 Difference]: Start difference. First operand 1474 states and 2416 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:13:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:05,015 INFO L93 Difference]: Finished difference Result 3423 states and 5778 transitions. [2022-11-02 21:13:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:13:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2022-11-02 21:13:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:05,031 INFO L225 Difference]: With dead ends: 3423 [2022-11-02 21:13:05,031 INFO L226 Difference]: Without dead ends: 2013 [2022-11-02 21:13:05,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:13:05,040 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 1383 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:05,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 2091 Invalid, 2673 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [393 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-02 21:13:05,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2022-11-02 21:13:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1476. [2022-11-02 21:13:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1163 states have (on average 1.6053310404127257) internal successors, (1867), 1220 states have internal predecessors, (1867), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:13:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2418 transitions. [2022-11-02 21:13:05,483 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2418 transitions. Word has length 103 [2022-11-02 21:13:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:05,484 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 2418 transitions. [2022-11-02 21:13:05,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:13:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2418 transitions. [2022-11-02 21:13:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 21:13:05,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:05,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:05,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:13:05,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:05,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1002941299, now seen corresponding path program 1 times [2022-11-02 21:13:05,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:05,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140893055] [2022-11-02 21:13:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:05,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:05,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:13:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:05,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:13:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:06,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:06,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:13:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:13:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:13:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:13:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:06,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140893055] [2022-11-02 21:13:06,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140893055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:06,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:06,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:13:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518275001] [2022-11-02 21:13:06,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:06,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:13:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:06,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:13:06,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:13:06,120 INFO L87 Difference]: Start difference. First operand 1476 states and 2418 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:13:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:12,921 INFO L93 Difference]: Finished difference Result 3414 states and 5764 transitions. [2022-11-02 21:13:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:13:12,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-11-02 21:13:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:12,941 INFO L225 Difference]: With dead ends: 3414 [2022-11-02 21:13:12,942 INFO L226 Difference]: Without dead ends: 1996 [2022-11-02 21:13:12,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:13:12,948 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 1814 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 2012 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:12,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 2012 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-02 21:13:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2022-11-02 21:13:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1476. [2022-11-02 21:13:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1163 states have (on average 1.6010318142734308) internal successors, (1862), 1220 states have internal predecessors, (1862), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:13:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2413 transitions. [2022-11-02 21:13:13,649 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2413 transitions. Word has length 104 [2022-11-02 21:13:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:13,649 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 2413 transitions. [2022-11-02 21:13:13,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:13:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2413 transitions. [2022-11-02 21:13:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 21:13:13,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:13,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:13,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:13:13,654 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1927738160, now seen corresponding path program 1 times [2022-11-02 21:13:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:13,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715202358] [2022-11-02 21:13:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:13:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:13:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:13:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:13:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:13:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:13:14,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:14,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715202358] [2022-11-02 21:13:14,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715202358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:14,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:14,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:13:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401450879] [2022-11-02 21:13:14,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:14,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:13:14,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:14,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:13:14,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:13:14,250 INFO L87 Difference]: Start difference. First operand 1476 states and 2413 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:13:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:22,512 INFO L93 Difference]: Finished difference Result 3427 states and 5775 transitions. [2022-11-02 21:13:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:13:22,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-11-02 21:13:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:22,526 INFO L225 Difference]: With dead ends: 3427 [2022-11-02 21:13:22,526 INFO L226 Difference]: Without dead ends: 2017 [2022-11-02 21:13:22,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:13:22,535 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 975 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:22,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 2145 Invalid, 2582 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [264 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-02 21:13:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2022-11-02 21:13:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1479. [2022-11-02 21:13:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1166 states have (on average 1.5994854202401372) internal successors, (1865), 1223 states have internal predecessors, (1865), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:13:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2416 transitions. [2022-11-02 21:13:23,170 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2416 transitions. Word has length 104 [2022-11-02 21:13:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:23,170 INFO L495 AbstractCegarLoop]: Abstraction has 1479 states and 2416 transitions. [2022-11-02 21:13:23,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:13:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2416 transitions. [2022-11-02 21:13:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 21:13:23,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:23,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:23,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:13:23,175 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash 619202400, now seen corresponding path program 1 times [2022-11-02 21:13:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:23,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547894861] [2022-11-02 21:13:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:13:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:13:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:13:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:13:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:13:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:13:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:13:23,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:23,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547894861] [2022-11-02 21:13:23,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547894861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:23,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:23,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:13:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862213596] [2022-11-02 21:13:23,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:23,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:13:23,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:23,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:13:23,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:13:23,757 INFO L87 Difference]: Start difference. First operand 1479 states and 2416 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:13:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:30,933 INFO L93 Difference]: Finished difference Result 3463 states and 5818 transitions. [2022-11-02 21:13:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:13:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2022-11-02 21:13:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:30,953 INFO L225 Difference]: With dead ends: 3463 [2022-11-02 21:13:30,954 INFO L226 Difference]: Without dead ends: 2002 [2022-11-02 21:13:30,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:13:30,963 INFO L413 NwaCegarLoop]: 857 mSDtfsCounter, 1731 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:30,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 2026 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-02 21:13:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2022-11-02 21:13:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1479. [2022-11-02 21:13:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1166 states have (on average 1.5986277873070327) internal successors, (1864), 1223 states have internal predecessors, (1864), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:13:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2415 transitions. [2022-11-02 21:13:31,551 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2415 transitions. Word has length 105 [2022-11-02 21:13:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:31,551 INFO L495 AbstractCegarLoop]: Abstraction has 1479 states and 2415 transitions. [2022-11-02 21:13:31,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:13:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2415 transitions. [2022-11-02 21:13:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 21:13:31,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:31,555 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:31,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:13:31,555 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1030934399, now seen corresponding path program 1 times [2022-11-02 21:13:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:31,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547049428] [2022-11-02 21:13:31,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:13:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:31,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:13:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:13:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:13:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:13:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:13:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:13:32,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:32,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547049428] [2022-11-02 21:13:32,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547049428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:32,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:32,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:13:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269775438] [2022-11-02 21:13:32,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:32,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:13:32,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:13:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:13:32,232 INFO L87 Difference]: Start difference. First operand 1479 states and 2415 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:13:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:41,227 INFO L93 Difference]: Finished difference Result 3423 states and 5768 transitions. [2022-11-02 21:13:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:13:41,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2022-11-02 21:13:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:41,242 INFO L225 Difference]: With dead ends: 3423 [2022-11-02 21:13:41,242 INFO L226 Difference]: Without dead ends: 1992 [2022-11-02 21:13:41,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:13:41,250 INFO L413 NwaCegarLoop]: 857 mSDtfsCounter, 1416 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 4327 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 3353 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 4327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:41,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 3353 Invalid, 4714 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [387 Valid, 4327 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-11-02 21:13:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-11-02 21:13:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1471. [2022-11-02 21:13:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1158 states have (on average 1.6001727115716753) internal successors, (1853), 1215 states have internal predecessors, (1853), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:13:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2404 transitions. [2022-11-02 21:13:41,811 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2404 transitions. Word has length 105 [2022-11-02 21:13:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:41,811 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 2404 transitions. [2022-11-02 21:13:41,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:13:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2404 transitions. [2022-11-02 21:13:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 21:13:41,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:41,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:41,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:13:41,816 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:41,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1784898178, now seen corresponding path program 1 times [2022-11-02 21:13:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:41,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459152673] [2022-11-02 21:13:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:13:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:13:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:13:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:13:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:13:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:13:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:13:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459152673] [2022-11-02 21:13:42,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459152673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:42,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:42,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:13:42,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527923033] [2022-11-02 21:13:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:42,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:13:42,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:42,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:13:42,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:13:42,486 INFO L87 Difference]: Start difference. First operand 1471 states and 2404 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:13:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:51,816 INFO L93 Difference]: Finished difference Result 3423 states and 5764 transitions. [2022-11-02 21:13:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:13:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2022-11-02 21:13:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:51,831 INFO L225 Difference]: With dead ends: 3423 [2022-11-02 21:13:51,832 INFO L226 Difference]: Without dead ends: 2013 [2022-11-02 21:13:51,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:13:51,839 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 1372 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 4291 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 3331 SdHoareTripleChecker+Invalid, 4692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 4291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:51,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 3331 Invalid, 4692 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [401 Valid, 4291 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-11-02 21:13:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2022-11-02 21:13:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1475. [2022-11-02 21:13:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1162 states have (on average 1.5981067125645438) internal successors, (1857), 1219 states have internal predecessors, (1857), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:13:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2408 transitions. [2022-11-02 21:13:52,397 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2408 transitions. Word has length 105 [2022-11-02 21:13:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:52,398 INFO L495 AbstractCegarLoop]: Abstraction has 1475 states and 2408 transitions. [2022-11-02 21:13:52,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:13:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2408 transitions. [2022-11-02 21:13:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 21:13:52,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:52,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:52,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:13:52,401 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1225052650, now seen corresponding path program 1 times [2022-11-02 21:13:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:52,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414335023] [2022-11-02 21:13:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:13:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:13:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:13:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:53,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:53,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:13:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:53,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:13:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:53,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:13:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:13:53,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:53,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414335023] [2022-11-02 21:13:53,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414335023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:53,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:53,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:13:53,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737408862] [2022-11-02 21:13:53,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:53,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:13:53,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:13:53,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:13:53,050 INFO L87 Difference]: Start difference. First operand 1475 states and 2408 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:14:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:02,284 INFO L93 Difference]: Finished difference Result 3431 states and 5770 transitions. [2022-11-02 21:14:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:14:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2022-11-02 21:14:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:02,299 INFO L225 Difference]: With dead ends: 3431 [2022-11-02 21:14:02,300 INFO L226 Difference]: Without dead ends: 2021 [2022-11-02 21:14:02,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:14:02,305 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 1773 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 4243 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1837 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 4771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 4243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:02,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1837 Valid, 3299 Invalid, 4771 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [528 Valid, 4243 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-11-02 21:14:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-11-02 21:14:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1480. [2022-11-02 21:14:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1167 states have (on average 1.5955441302485005) internal successors, (1862), 1224 states have internal predecessors, (1862), 240 states have call successors, (240), 61 states have call predecessors, (240), 72 states have return successors, (311), 230 states have call predecessors, (311), 235 states have call successors, (311) [2022-11-02 21:14:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2413 transitions. [2022-11-02 21:14:02,862 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2413 transitions. Word has length 106 [2022-11-02 21:14:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:02,862 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 2413 transitions. [2022-11-02 21:14:02,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:14:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2413 transitions. [2022-11-02 21:14:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 21:14:02,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:02,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:02,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:14:02,865 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:02,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1470623475, now seen corresponding path program 1 times [2022-11-02 21:14:02,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:02,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769800065] [2022-11-02 21:14:02,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:02,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:14:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:14:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:14:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:14:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:14:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:14:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:14:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:14:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:14:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769800065] [2022-11-02 21:14:03,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769800065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:03,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:03,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:14:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564008798] [2022-11-02 21:14:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:03,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:14:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:14:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:14:03,593 INFO L87 Difference]: Start difference. First operand 1480 states and 2413 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:14:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:18,438 INFO L93 Difference]: Finished difference Result 4849 states and 8352 transitions. [2022-11-02 21:14:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 21:14:18,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2022-11-02 21:14:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:18,469 INFO L225 Difference]: With dead ends: 4849 [2022-11-02 21:14:18,469 INFO L226 Difference]: Without dead ends: 3447 [2022-11-02 21:14:18,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-11-02 21:14:18,479 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 4094 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 4381 mSolverCounterSat, 1326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4158 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 5707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1326 IncrementalHoareTripleChecker+Valid, 4381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:18,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4158 Valid, 2625 Invalid, 5707 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1326 Valid, 4381 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-11-02 21:14:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2022-11-02 21:14:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 2518. [2022-11-02 21:14:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 1989 states have (on average 1.592760180995475) internal successors, (3168), 2078 states have internal predecessors, (3168), 396 states have call successors, (396), 102 states have call predecessors, (396), 132 states have return successors, (535), 397 states have call predecessors, (535), 391 states have call successors, (535) [2022-11-02 21:14:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4099 transitions. [2022-11-02 21:14:19,433 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4099 transitions. Word has length 107 [2022-11-02 21:14:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:19,434 INFO L495 AbstractCegarLoop]: Abstraction has 2518 states and 4099 transitions. [2022-11-02 21:14:19,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:14:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4099 transitions. [2022-11-02 21:14:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 21:14:19,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:19,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:19,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:14:19,438 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1495805578, now seen corresponding path program 1 times [2022-11-02 21:14:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:19,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51580795] [2022-11-02 21:14:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:14:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:14:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:19,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:14:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:14:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:14:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 21:14:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:14:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:14:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:14:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51580795] [2022-11-02 21:14:20,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51580795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:14:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123681957] [2022-11-02 21:14:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:20,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:14:20,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:14:20,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:14:20,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb887d6a-2752-4e15-842e-757c98243a58/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:14:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:20,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:14:20,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:14:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:14:21,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:14:21,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123681957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:21,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:14:21,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-02 21:14:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281221914] [2022-11-02 21:14:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:21,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:14:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:14:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:14:21,111 INFO L87 Difference]: Start difference. First operand 2518 states and 4099 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11)