./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.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_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/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_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/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_f1d39e0f-c649-4114-a70e-baa1bd41ca95/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 b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad --- 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 20:04:07,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:04:07,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:04:07,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:04:07,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:04:07,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:04:07,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:04:07,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:04:07,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:04:07,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:04:07,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:04:07,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:04:07,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:04:07,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:04:07,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:04:07,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:04:07,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:04:07,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:04:07,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:04:07,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:04:07,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:04:07,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:04:07,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:04:07,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:04:07,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:04:07,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:04:07,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:04:07,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:04:07,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:04:07,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:04:07,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:04:07,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:04:07,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:04:07,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:04:07,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:04:07,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:04:07,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:04:07,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:04:07,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:04:07,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:04:07,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:04:07,898 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:04:07,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:04:07,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:04:07,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:04:07,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:04:07,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:04:07,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:04:07,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:04:07,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:04:07,956 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:04:07,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:04:07,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:04:07,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:04:07,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:04:07,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:04:07,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:04:07,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:04:07,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:04:07,959 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:04:07,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:04:07,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:04:07,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:04:07,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:04:07,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:04:07,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:04:07,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:04:07,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:04:07,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:04:07,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:04:07,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:04:07,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:04:07,963 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:04:07,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:04:07,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:04:07,964 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_f1d39e0f-c649-4114-a70e-baa1bd41ca95/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_f1d39e0f-c649-4114-a70e-baa1bd41ca95/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 -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2022-11-02 20:04:08,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:04:08,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:04:08,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:04:08,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:04:08,392 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:04:08,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-11-02 20:04:08,489 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/data/2c77b6f80/36c49fb963f54fb2accec028777ccba3/FLAG7617f8edd [2022-11-02 20:04:09,191 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:04:09,191 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-11-02 20:04:09,209 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/data/2c77b6f80/36c49fb963f54fb2accec028777ccba3/FLAG7617f8edd [2022-11-02 20:04:09,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/data/2c77b6f80/36c49fb963f54fb2accec028777ccba3 [2022-11-02 20:04:09,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:04:09,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:04:09,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:04:09,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:04:09,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:04:09,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:04:09" (1/1) ... [2022-11-02 20:04:09,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71997709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:09, skipping insertion in model container [2022-11-02 20:04:09,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:04:09" (1/1) ... [2022-11-02 20:04:09,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:04:09,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:04:09,998 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_f1d39e0f-c649-4114-a70e-baa1bd41ca95/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-11-02 20:04:10,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:04:10,022 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:04:10,223 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_f1d39e0f-c649-4114-a70e-baa1bd41ca95/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-11-02 20:04:10,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:04:10,243 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:04:10,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10 WrapperNode [2022-11-02 20:04:10,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:04:10,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:04:10,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:04:10,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:04:10,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,350 INFO L138 Inliner]: procedures = 41, calls = 76, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 1331 [2022-11-02 20:04:10,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:04:10,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:04:10,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:04:10,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:04:10,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,409 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:04:10,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:04:10,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:04:10,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:04:10,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (1/1) ... [2022-11-02 20:04:10,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:04:10,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:10,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:04:10,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d39e0f-c649-4114-a70e-baa1bd41ca95/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:04:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:04:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-11-02 20:04:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-11-02 20:04:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-11-02 20:04:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-11-02 20:04:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-02 20:04:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-02 20:04:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 20:04:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 20:04:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 20:04:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 20:04:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:04:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 20:04:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 20:04:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-11-02 20:04:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-11-02 20:04:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:04:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:04:10,876 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:04:10,879 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:04:10,889 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,011 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-02 20:04:11,011 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-02 20:04:11,012 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,027 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-02 20:04:11,027 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-02 20:04:11,044 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,054 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,066 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,069 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,073 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,075 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,081 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:11,940 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume !false; [2022-11-02 20:04:11,940 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2022-11-02 20:04:11,940 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2022-11-02 20:04:11,940 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume !false; [2022-11-02 20:04:11,941 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##66: assume false; [2022-11-02 20:04:11,941 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##127: assume !false; [2022-11-02 20:04:11,941 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2022-11-02 20:04:11,941 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2022-11-02 20:04:11,941 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-11-02 20:04:11,941 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-11-02 20:04:11,942 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##169: assume false; [2022-11-02 20:04:11,942 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##236: assume !false; [2022-11-02 20:04:11,942 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##235: assume false; [2022-11-02 20:04:11,942 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##126: assume false; [2022-11-02 20:04:11,944 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:12,030 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-02 20:04:12,030 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-02 20:04:12,032 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:12,033 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:12,033 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:04:12,152 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-11-02 20:04:12,152 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2022-11-02 20:04:12,153 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2022-11-02 20:04:12,153 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-11-02 20:04:12,153 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-11-02 20:04:12,153 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-11-02 20:04:12,185 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:04:12,198 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:04:12,198 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:04:12,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:12 BoogieIcfgContainer [2022-11-02 20:04:12,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:04:12,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:04:12,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:04:12,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:04:12,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:04:09" (1/3) ... [2022-11-02 20:04:12,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a286376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:04:12, skipping insertion in model container [2022-11-02 20:04:12,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:10" (2/3) ... [2022-11-02 20:04:12,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a286376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:04:12, skipping insertion in model container [2022-11-02 20:04:12,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:12" (3/3) ... [2022-11-02 20:04:12,212 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2022-11-02 20:04:12,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:04:12,237 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:04:12,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:04:12,325 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;@705b4cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:04:12,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:04:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 259 states have (on average 1.5212355212355213) internal successors, (394), 284 states have internal predecessors, (394), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-02 20:04:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:04:12,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:12,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:12,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash -581881369, now seen corresponding path program 1 times [2022-11-02 20:04:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:12,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339057305] [2022-11-02 20:04:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:12,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:12,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339057305] [2022-11-02 20:04:12,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339057305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:12,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:12,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919206824] [2022-11-02 20:04:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:12,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:12,861 INFO L87 Difference]: Start difference. First operand has 318 states, 259 states have (on average 1.5212355212355213) internal successors, (394), 284 states have internal predecessors, (394), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:13,088 INFO L93 Difference]: Finished difference Result 511 states and 794 transitions. [2022-11-02 20:04:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:04:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:13,121 INFO L225 Difference]: With dead ends: 511 [2022-11-02 20:04:13,121 INFO L226 Difference]: Without dead ends: 310 [2022-11-02 20:04:13,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:13,138 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 261 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:13,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 629 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:04:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-02 20:04:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2022-11-02 20:04:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 253 states have (on average 1.4782608695652173) internal successors, (374), 276 states have internal predecessors, (374), 50 states have call successors, (50), 7 states have call predecessors, (50), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-02 20:04:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 453 transitions. [2022-11-02 20:04:13,329 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 453 transitions. Word has length 13 [2022-11-02 20:04:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:13,330 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 453 transitions. [2022-11-02 20:04:13,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 453 transitions. [2022-11-02 20:04:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:04:13,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:13,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:13,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:04:13,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1536856865, now seen corresponding path program 1 times [2022-11-02 20:04:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:13,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720676847] [2022-11-02 20:04:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:13,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:13,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720676847] [2022-11-02 20:04:13,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720676847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:13,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:13,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122928981] [2022-11-02 20:04:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:13,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:13,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:13,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:13,569 INFO L87 Difference]: Start difference. First operand 310 states and 453 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:13,836 INFO L93 Difference]: Finished difference Result 558 states and 805 transitions. [2022-11-02 20:04:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:13,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:04:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:13,845 INFO L225 Difference]: With dead ends: 558 [2022-11-02 20:04:13,845 INFO L226 Difference]: Without dead ends: 428 [2022-11-02 20:04:13,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:13,855 INFO L413 NwaCegarLoop]: 560 mSDtfsCounter, 359 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:13,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 752 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:04:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-11-02 20:04:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 411. [2022-11-02 20:04:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 353 states have (on average 1.4022662889518414) internal successors, (495), 356 states have internal predecessors, (495), 48 states have call successors, (48), 11 states have call predecessors, (48), 9 states have return successors, (52), 44 states have call predecessors, (52), 37 states have call successors, (52) [2022-11-02 20:04:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 595 transitions. [2022-11-02 20:04:13,919 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 595 transitions. Word has length 16 [2022-11-02 20:04:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:13,920 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 595 transitions. [2022-11-02 20:04:13,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 595 transitions. [2022-11-02 20:04:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:04:13,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:13,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:13,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:04:13,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash -866854987, now seen corresponding path program 1 times [2022-11-02 20:04:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:13,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549959290] [2022-11-02 20:04:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:14,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549959290] [2022-11-02 20:04:14,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549959290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:14,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:14,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:14,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831097216] [2022-11-02 20:04:14,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:14,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:14,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:14,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:14,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:14,024 INFO L87 Difference]: Start difference. First operand 411 states and 595 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:14,103 INFO L93 Difference]: Finished difference Result 516 states and 730 transitions. [2022-11-02 20:04:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:14,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:04:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:14,111 INFO L225 Difference]: With dead ends: 516 [2022-11-02 20:04:14,112 INFO L226 Difference]: Without dead ends: 497 [2022-11-02 20:04:14,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:14,114 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 407 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:14,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 540 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:04:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-11-02 20:04:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 459. [2022-11-02 20:04:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 394 states have (on average 1.3959390862944163) internal successors, (550), 404 states have internal predecessors, (550), 50 states have call successors, (50), 14 states have call predecessors, (50), 14 states have return successors, (59), 43 states have call predecessors, (59), 41 states have call successors, (59) [2022-11-02 20:04:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 659 transitions. [2022-11-02 20:04:14,157 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 659 transitions. Word has length 19 [2022-11-02 20:04:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:14,158 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 659 transitions. [2022-11-02 20:04:14,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 659 transitions. [2022-11-02 20:04:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:04:14,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:14,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:14,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:04:14,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash 122564178, now seen corresponding path program 1 times [2022-11-02 20:04:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:14,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907654661] [2022-11-02 20:04:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:14,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:14,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907654661] [2022-11-02 20:04:14,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907654661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:14,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:14,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:14,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970211399] [2022-11-02 20:04:14,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:14,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:14,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:14,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:14,245 INFO L87 Difference]: Start difference. First operand 459 states and 659 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:14,320 INFO L93 Difference]: Finished difference Result 861 states and 1224 transitions. [2022-11-02 20:04:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:14,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:04:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:14,327 INFO L225 Difference]: With dead ends: 861 [2022-11-02 20:04:14,327 INFO L226 Difference]: Without dead ends: 638 [2022-11-02 20:04:14,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:14,330 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 394 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:14,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 655 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:04:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-11-02 20:04:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 613. [2022-11-02 20:04:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 531 states have (on average 1.384180790960452) internal successors, (735), 538 states have internal predecessors, (735), 60 states have call successors, (60), 22 states have call predecessors, (60), 21 states have return successors, (80), 55 states have call predecessors, (80), 53 states have call successors, (80) [2022-11-02 20:04:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 875 transitions. [2022-11-02 20:04:14,390 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 875 transitions. Word has length 22 [2022-11-02 20:04:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:14,391 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 875 transitions. [2022-11-02 20:04:14,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 875 transitions. [2022-11-02 20:04:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:04:14,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:14,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:14,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:04:14,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:14,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash -278451968, now seen corresponding path program 1 times [2022-11-02 20:04:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:14,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893464402] [2022-11-02 20:04:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:04:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:04:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:14,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893464402] [2022-11-02 20:04:14,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893464402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:14,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:14,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:04:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276001822] [2022-11-02 20:04:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:14,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:04:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:04:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:14,512 INFO L87 Difference]: Start difference. First operand 613 states and 875 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:04:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:14,938 INFO L93 Difference]: Finished difference Result 674 states and 955 transitions. [2022-11-02 20:04:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-02 20:04:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:14,944 INFO L225 Difference]: With dead ends: 674 [2022-11-02 20:04:14,944 INFO L226 Difference]: Without dead ends: 669 [2022-11-02 20:04:14,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:14,946 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 188 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:14,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 996 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-02 20:04:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 648. [2022-11-02 20:04:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 564 states have (on average 1.375886524822695) internal successors, (776), 571 states have internal predecessors, (776), 60 states have call successors, (60), 22 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2022-11-02 20:04:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 921 transitions. [2022-11-02 20:04:15,022 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 921 transitions. Word has length 30 [2022-11-02 20:04:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:15,022 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 921 transitions. [2022-11-02 20:04:15,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:04:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 921 transitions. [2022-11-02 20:04:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:04:15,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:15,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:15,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:04:15,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash 935646203, now seen corresponding path program 1 times [2022-11-02 20:04:15,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:15,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915021520] [2022-11-02 20:04:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:15,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915021520] [2022-11-02 20:04:15,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915021520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:15,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:15,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252404646] [2022-11-02 20:04:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:15,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:15,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:15,199 INFO L87 Difference]: Start difference. First operand 648 states and 921 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:15,361 INFO L93 Difference]: Finished difference Result 663 states and 941 transitions. [2022-11-02 20:04:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:04:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:15,367 INFO L225 Difference]: With dead ends: 663 [2022-11-02 20:04:15,367 INFO L226 Difference]: Without dead ends: 660 [2022-11-02 20:04:15,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:15,369 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 20 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:15,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 778 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-11-02 20:04:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 659. [2022-11-02 20:04:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.373913043478261) internal successors, (790), 581 states have internal predecessors, (790), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2022-11-02 20:04:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 935 transitions. [2022-11-02 20:04:15,430 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 935 transitions. Word has length 28 [2022-11-02 20:04:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:15,431 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 935 transitions. [2022-11-02 20:04:15,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 935 transitions. [2022-11-02 20:04:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:04:15,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:15,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:15,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:04:15,434 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:15,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash -525593641, now seen corresponding path program 1 times [2022-11-02 20:04:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:15,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243974144] [2022-11-02 20:04:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:04:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:04:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:15,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:15,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243974144] [2022-11-02 20:04:15,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243974144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:15,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:15,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:04:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036542398] [2022-11-02 20:04:15,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:15,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:04:15,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:15,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:04:15,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:15,651 INFO L87 Difference]: Start difference. First operand 659 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:16,360 INFO L93 Difference]: Finished difference Result 686 states and 968 transitions. [2022-11-02 20:04:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:04:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-02 20:04:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:16,368 INFO L225 Difference]: With dead ends: 686 [2022-11-02 20:04:16,371 INFO L226 Difference]: Without dead ends: 680 [2022-11-02 20:04:16,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:04:16,377 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 681 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:16,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 948 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-11-02 20:04:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2022-11-02 20:04:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.3721739130434782) internal successors, (789), 581 states have internal predecessors, (789), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2022-11-02 20:04:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 934 transitions. [2022-11-02 20:04:16,466 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 934 transitions. Word has length 30 [2022-11-02 20:04:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:16,468 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 934 transitions. [2022-11-02 20:04:16,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 934 transitions. [2022-11-02 20:04:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:04:16,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:16,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:16,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:04:16,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1034674387, now seen corresponding path program 1 times [2022-11-02 20:04:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:16,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762126896] [2022-11-02 20:04:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:16,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:04:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:04:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:16,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762126896] [2022-11-02 20:04:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762126896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:16,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:16,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:04:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818951500] [2022-11-02 20:04:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:16,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:04:16,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:16,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:04:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:16,716 INFO L87 Difference]: Start difference. First operand 659 states and 934 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:17,477 INFO L93 Difference]: Finished difference Result 686 states and 967 transitions. [2022-11-02 20:04:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:04:17,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-02 20:04:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:17,482 INFO L225 Difference]: With dead ends: 686 [2022-11-02 20:04:17,482 INFO L226 Difference]: Without dead ends: 680 [2022-11-02 20:04:17,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:04:17,484 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 597 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:17,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1201 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:04:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-11-02 20:04:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2022-11-02 20:04:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.3704347826086956) internal successors, (788), 581 states have internal predecessors, (788), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2022-11-02 20:04:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 933 transitions. [2022-11-02 20:04:17,571 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 933 transitions. Word has length 32 [2022-11-02 20:04:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:17,573 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 933 transitions. [2022-11-02 20:04:17,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 933 transitions. [2022-11-02 20:04:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:04:17,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:17,575 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] [2022-11-02 20:04:17,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:04:17,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1926147241, now seen corresponding path program 1 times [2022-11-02 20:04:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:17,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784300382] [2022-11-02 20:04:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:17,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:17,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:04:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:04:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:17,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784300382] [2022-11-02 20:04:17,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784300382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:17,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:17,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092250260] [2022-11-02 20:04:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:17,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:17,720 INFO L87 Difference]: Start difference. First operand 659 states and 933 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:04:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:18,300 INFO L93 Difference]: Finished difference Result 691 states and 972 transitions. [2022-11-02 20:04:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:04:18,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-02 20:04:18,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:18,306 INFO L225 Difference]: With dead ends: 691 [2022-11-02 20:04:18,307 INFO L226 Difference]: Without dead ends: 676 [2022-11-02 20:04:18,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:18,310 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 322 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:18,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1724 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-02 20:04:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 657. [2022-11-02 20:04:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 574 states have (on average 1.3693379790940767) internal successors, (786), 580 states have internal predecessors, (786), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (84), 54 states have call predecessors, (84), 52 states have call successors, (84) [2022-11-02 20:04:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 929 transitions. [2022-11-02 20:04:18,390 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 929 transitions. Word has length 33 [2022-11-02 20:04:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:18,390 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 929 transitions. [2022-11-02 20:04:18,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:04:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 929 transitions. [2022-11-02 20:04:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:04:18,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:18,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:18,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:04:18,393 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:18,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash 898874144, now seen corresponding path program 1 times [2022-11-02 20:04:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:18,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374214019] [2022-11-02 20:04:18,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:18,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:18,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:04:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:04:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:18,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:18,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374214019] [2022-11-02 20:04:18,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374214019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:18,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:18,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:18,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673484359] [2022-11-02 20:04:18,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:18,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:18,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:18,560 INFO L87 Difference]: Start difference. First operand 657 states and 929 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:04:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:19,075 INFO L93 Difference]: Finished difference Result 689 states and 968 transitions. [2022-11-02 20:04:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:04:19,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-02 20:04:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:19,082 INFO L225 Difference]: With dead ends: 689 [2022-11-02 20:04:19,082 INFO L226 Difference]: Without dead ends: 669 [2022-11-02 20:04:19,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:19,083 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 394 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:19,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1431 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-02 20:04:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 650. [2022-11-02 20:04:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 570 states have (on average 1.3701754385964913) internal successors, (781), 576 states have internal predecessors, (781), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (82), 52 states have call predecessors, (82), 50 states have call successors, (82) [2022-11-02 20:04:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 920 transitions. [2022-11-02 20:04:19,156 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 920 transitions. Word has length 32 [2022-11-02 20:04:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:19,157 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 920 transitions. [2022-11-02 20:04:19,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:04:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 920 transitions. [2022-11-02 20:04:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:04:19,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:19,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:19,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:04:19,161 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash -608614915, now seen corresponding path program 1 times [2022-11-02 20:04:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:19,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258765671] [2022-11-02 20:04:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:19,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258765671] [2022-11-02 20:04:19,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258765671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:19,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:19,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598026428] [2022-11-02 20:04:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:19,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:19,222 INFO L87 Difference]: Start difference. First operand 650 states and 920 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:19,314 INFO L93 Difference]: Finished difference Result 691 states and 968 transitions. [2022-11-02 20:04:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:19,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:04:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:19,320 INFO L225 Difference]: With dead ends: 691 [2022-11-02 20:04:19,320 INFO L226 Difference]: Without dead ends: 625 [2022-11-02 20:04:19,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:19,322 INFO L413 NwaCegarLoop]: 483 mSDtfsCounter, 84 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:19,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 880 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:04:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-11-02 20:04:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 621. [2022-11-02 20:04:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 545 states have (on average 1.3688073394495412) internal successors, (746), 552 states have internal predecessors, (746), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:04:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 879 transitions. [2022-11-02 20:04:19,386 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 879 transitions. Word has length 30 [2022-11-02 20:04:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:19,386 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 879 transitions. [2022-11-02 20:04:19,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 879 transitions. [2022-11-02 20:04:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:04:19,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:19,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:19,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:04:19,389 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash -444205803, now seen corresponding path program 1 times [2022-11-02 20:04:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:19,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188608168] [2022-11-02 20:04:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:19,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188608168] [2022-11-02 20:04:19,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188608168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:19,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:19,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:04:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672893168] [2022-11-02 20:04:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:19,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:04:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:04:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:04:19,521 INFO L87 Difference]: Start difference. First operand 621 states and 879 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:19,656 INFO L93 Difference]: Finished difference Result 657 states and 920 transitions. [2022-11-02 20:04:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:04:19,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:04:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:19,662 INFO L225 Difference]: With dead ends: 657 [2022-11-02 20:04:19,663 INFO L226 Difference]: Without dead ends: 637 [2022-11-02 20:04:19,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:19,665 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 27 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:19,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1213 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:04:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-02 20:04:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 623. [2022-11-02 20:04:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 554 states have internal predecessors, (748), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:04:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 881 transitions. [2022-11-02 20:04:19,728 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 881 transitions. Word has length 30 [2022-11-02 20:04:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:19,729 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 881 transitions. [2022-11-02 20:04:19,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 881 transitions. [2022-11-02 20:04:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:04:19,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:19,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:19,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:04:19,735 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1157172893, now seen corresponding path program 1 times [2022-11-02 20:04:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:19,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862773060] [2022-11-02 20:04:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:19,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862773060] [2022-11-02 20:04:19,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862773060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:19,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:19,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:04:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392897100] [2022-11-02 20:04:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:19,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:04:19,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:19,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:04:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:04:19,822 INFO L87 Difference]: Start difference. First operand 623 states and 881 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:19,929 INFO L93 Difference]: Finished difference Result 659 states and 922 transitions. [2022-11-02 20:04:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:04:19,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:04:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:19,933 INFO L225 Difference]: With dead ends: 659 [2022-11-02 20:04:19,934 INFO L226 Difference]: Without dead ends: 639 [2022-11-02 20:04:19,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:19,936 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 28 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:19,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1217 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:04:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-11-02 20:04:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 623. [2022-11-02 20:04:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 554 states have internal predecessors, (748), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:04:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 881 transitions. [2022-11-02 20:04:20,029 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 881 transitions. Word has length 31 [2022-11-02 20:04:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:20,030 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 881 transitions. [2022-11-02 20:04:20,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 881 transitions. [2022-11-02 20:04:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:04:20,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:20,032 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] [2022-11-02 20:04:20,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:04:20,033 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1727959565, now seen corresponding path program 1 times [2022-11-02 20:04:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:20,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545274151] [2022-11-02 20:04:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:20,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545274151] [2022-11-02 20:04:20,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545274151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:20,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:20,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:04:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861746055] [2022-11-02 20:04:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:20,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:04:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:20,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:04:20,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:04:20,136 INFO L87 Difference]: Start difference. First operand 623 states and 881 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:20,607 INFO L93 Difference]: Finished difference Result 884 states and 1250 transitions. [2022-11-02 20:04:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:04:20,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-11-02 20:04:20,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:20,613 INFO L225 Difference]: With dead ends: 884 [2022-11-02 20:04:20,613 INFO L226 Difference]: Without dead ends: 881 [2022-11-02 20:04:20,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:20,617 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 162 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:20,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1105 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-02 20:04:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 702. [2022-11-02 20:04:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 622 states have (on average 1.3762057877813505) internal successors, (856), 630 states have internal predecessors, (856), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (80), 49 states have call predecessors, (80), 50 states have call successors, (80) [2022-11-02 20:04:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 993 transitions. [2022-11-02 20:04:20,707 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 993 transitions. Word has length 34 [2022-11-02 20:04:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:20,708 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 993 transitions. [2022-11-02 20:04:20,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 993 transitions. [2022-11-02 20:04:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:04:20,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:20,710 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] [2022-11-02 20:04:20,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:04:20,711 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2030213193, now seen corresponding path program 1 times [2022-11-02 20:04:20,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:20,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528753201] [2022-11-02 20:04:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:04:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:20,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528753201] [2022-11-02 20:04:20,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528753201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:20,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:20,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:04:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407103186] [2022-11-02 20:04:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:20,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:04:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:20,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:04:20,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:20,801 INFO L87 Difference]: Start difference. First operand 702 states and 993 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:21,143 INFO L93 Difference]: Finished difference Result 733 states and 1030 transitions. [2022-11-02 20:04:21,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:04:21,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-11-02 20:04:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:21,148 INFO L225 Difference]: With dead ends: 733 [2022-11-02 20:04:21,148 INFO L226 Difference]: Without dead ends: 717 [2022-11-02 20:04:21,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:21,152 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 85 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:21,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1388 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:04:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-11-02 20:04:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 700. [2022-11-02 20:04:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 621 states have (on average 1.3752012882447664) internal successors, (854), 629 states have internal predecessors, (854), 56 states have call successors, (56), 23 states have call predecessors, (56), 22 states have return successors, (79), 48 states have call predecessors, (79), 49 states have call successors, (79) [2022-11-02 20:04:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 989 transitions. [2022-11-02 20:04:21,226 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 989 transitions. Word has length 33 [2022-11-02 20:04:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:21,228 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 989 transitions. [2022-11-02 20:04:21,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 989 transitions. [2022-11-02 20:04:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:04:21,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:21,230 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] [2022-11-02 20:04:21,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:04:21,231 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2029473173, now seen corresponding path program 1 times [2022-11-02 20:04:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:21,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361297624] [2022-11-02 20:04:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:21,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361297624] [2022-11-02 20:04:21,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361297624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:21,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:21,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:04:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163902868] [2022-11-02 20:04:21,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:21,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:04:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:21,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:04:21,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:21,465 INFO L87 Difference]: Start difference. First operand 700 states and 989 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:22,157 INFO L93 Difference]: Finished difference Result 1172 states and 1614 transitions. [2022-11-02 20:04:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-02 20:04:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:22,163 INFO L225 Difference]: With dead ends: 1172 [2022-11-02 20:04:22,163 INFO L226 Difference]: Without dead ends: 729 [2022-11-02 20:04:22,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:22,165 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 721 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:22,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 935 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-11-02 20:04:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 691. [2022-11-02 20:04:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 612 states have (on average 1.3611111111111112) internal successors, (833), 620 states have internal predecessors, (833), 56 states have call successors, (56), 23 states have call predecessors, (56), 22 states have return successors, (79), 48 states have call predecessors, (79), 49 states have call successors, (79) [2022-11-02 20:04:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 968 transitions. [2022-11-02 20:04:22,251 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 968 transitions. Word has length 35 [2022-11-02 20:04:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:22,251 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 968 transitions. [2022-11-02 20:04:22,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 968 transitions. [2022-11-02 20:04:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:04:22,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:22,253 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] [2022-11-02 20:04:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:04:22,254 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1933424636, now seen corresponding path program 1 times [2022-11-02 20:04:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:22,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720340668] [2022-11-02 20:04:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:04:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:22,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720340668] [2022-11-02 20:04:22,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720340668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:22,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:22,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:04:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477628082] [2022-11-02 20:04:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:22,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:04:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:04:22,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:22,371 INFO L87 Difference]: Start difference. First operand 691 states and 968 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:22,742 INFO L93 Difference]: Finished difference Result 722 states and 1005 transitions. [2022-11-02 20:04:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:04:22,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-02 20:04:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:22,747 INFO L225 Difference]: With dead ends: 722 [2022-11-02 20:04:22,747 INFO L226 Difference]: Without dead ends: 706 [2022-11-02 20:04:22,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:22,749 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 85 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:22,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1375 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:04:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-11-02 20:04:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 689. [2022-11-02 20:04:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 611 states have (on average 1.3600654664484453) internal successors, (831), 619 states have internal predecessors, (831), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:04:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 964 transitions. [2022-11-02 20:04:22,867 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 964 transitions. Word has length 35 [2022-11-02 20:04:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:22,867 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 964 transitions. [2022-11-02 20:04:22,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 964 transitions. [2022-11-02 20:04:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:04:22,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:22,871 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] [2022-11-02 20:04:22,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:04:22,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2075108197, now seen corresponding path program 1 times [2022-11-02 20:04:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:22,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665446036] [2022-11-02 20:04:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:22,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:22,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665446036] [2022-11-02 20:04:22,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665446036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:22,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:22,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:22,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576385871] [2022-11-02 20:04:22,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:22,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:22,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:22,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:22,930 INFO L87 Difference]: Start difference. First operand 689 states and 964 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:23,082 INFO L93 Difference]: Finished difference Result 1096 states and 1521 transitions. [2022-11-02 20:04:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:23,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:04:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:23,087 INFO L225 Difference]: With dead ends: 1096 [2022-11-02 20:04:23,087 INFO L226 Difference]: Without dead ends: 697 [2022-11-02 20:04:23,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:23,089 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 5 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:23,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 766 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-02 20:04:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2022-11-02 20:04:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 619 states have (on average 1.3602584814216478) internal successors, (842), 627 states have internal predecessors, (842), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:04:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 975 transitions. [2022-11-02 20:04:23,197 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 975 transitions. Word has length 37 [2022-11-02 20:04:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:23,197 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 975 transitions. [2022-11-02 20:04:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 975 transitions. [2022-11-02 20:04:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:04:23,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:23,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:23,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:04:23,200 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash 657684690, now seen corresponding path program 1 times [2022-11-02 20:04:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:23,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493537900] [2022-11-02 20:04:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:23,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:04:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:23,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493537900] [2022-11-02 20:04:23,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493537900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:23,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:23,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196371723] [2022-11-02 20:04:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:23,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:23,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:23,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:23,322 INFO L87 Difference]: Start difference. First operand 697 states and 975 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:23,779 INFO L93 Difference]: Finished difference Result 722 states and 1002 transitions. [2022-11-02 20:04:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:23,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-02 20:04:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:23,784 INFO L225 Difference]: With dead ends: 722 [2022-11-02 20:04:23,785 INFO L226 Difference]: Without dead ends: 704 [2022-11-02 20:04:23,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:23,786 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 96 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:23,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1693 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-11-02 20:04:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 697. [2022-11-02 20:04:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 619 states have (on average 1.3408723747980613) internal successors, (830), 627 states have internal predecessors, (830), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:04:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 963 transitions. [2022-11-02 20:04:23,880 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 963 transitions. Word has length 38 [2022-11-02 20:04:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:23,880 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 963 transitions. [2022-11-02 20:04:23,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 963 transitions. [2022-11-02 20:04:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:04:23,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:23,883 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] [2022-11-02 20:04:23,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:04:23,883 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash 101448372, now seen corresponding path program 1 times [2022-11-02 20:04:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:23,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524559201] [2022-11-02 20:04:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:04:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:24,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524559201] [2022-11-02 20:04:24,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524559201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:24,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:24,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142019181] [2022-11-02 20:04:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:24,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:24,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:24,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:24,027 INFO L87 Difference]: Start difference. First operand 697 states and 963 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:24,683 INFO L93 Difference]: Finished difference Result 783 states and 1067 transitions. [2022-11-02 20:04:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:04:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-02 20:04:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:24,687 INFO L225 Difference]: With dead ends: 783 [2022-11-02 20:04:24,688 INFO L226 Difference]: Without dead ends: 717 [2022-11-02 20:04:24,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:04:24,690 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 525 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:24,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1399 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-11-02 20:04:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2022-11-02 20:04:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 626 states have (on average 1.3354632587859425) internal successors, (836), 637 states have internal predecessors, (836), 55 states have call successors, (55), 23 states have call predecessors, (55), 25 states have return successors, (82), 47 states have call predecessors, (82), 48 states have call successors, (82) [2022-11-02 20:04:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 973 transitions. [2022-11-02 20:04:24,792 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 973 transitions. Word has length 38 [2022-11-02 20:04:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:24,792 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 973 transitions. [2022-11-02 20:04:24,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 973 transitions. [2022-11-02 20:04:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:04:24,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:24,795 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] [2022-11-02 20:04:24,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:04:24,795 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2119312611, now seen corresponding path program 1 times [2022-11-02 20:04:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:24,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000624979] [2022-11-02 20:04:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:04:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:24,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000624979] [2022-11-02 20:04:24,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000624979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:24,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:24,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937115027] [2022-11-02 20:04:24,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:24,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:24,936 INFO L87 Difference]: Start difference. First operand 707 states and 973 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:25,384 INFO L93 Difference]: Finished difference Result 727 states and 993 transitions. [2022-11-02 20:04:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:04:25,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:04:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:25,388 INFO L225 Difference]: With dead ends: 727 [2022-11-02 20:04:25,389 INFO L226 Difference]: Without dead ends: 705 [2022-11-02 20:04:25,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:25,390 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 108 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:25,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1971 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-11-02 20:04:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 699. [2022-11-02 20:04:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 619 states have (on average 1.3344103392568658) internal successors, (826), 630 states have internal predecessors, (826), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (81), 46 states have call predecessors, (81), 47 states have call successors, (81) [2022-11-02 20:04:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 961 transitions. [2022-11-02 20:04:25,484 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 961 transitions. Word has length 39 [2022-11-02 20:04:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:25,485 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 961 transitions. [2022-11-02 20:04:25,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 961 transitions. [2022-11-02 20:04:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:04:25,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:25,487 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] [2022-11-02 20:04:25,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:04:25,488 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash 114444064, now seen corresponding path program 1 times [2022-11-02 20:04:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:25,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004870964] [2022-11-02 20:04:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:25,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004870964] [2022-11-02 20:04:25,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004870964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:25,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:25,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546093394] [2022-11-02 20:04:25,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:25,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:25,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:25,583 INFO L87 Difference]: Start difference. First operand 699 states and 961 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:25,963 INFO L93 Difference]: Finished difference Result 721 states and 984 transitions. [2022-11-02 20:04:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:04:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:25,968 INFO L225 Difference]: With dead ends: 721 [2022-11-02 20:04:25,968 INFO L226 Difference]: Without dead ends: 697 [2022-11-02 20:04:25,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:25,970 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 312 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:25,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1330 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-02 20:04:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2022-11-02 20:04:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 611 states have (on average 1.3338788870703764) internal successors, (815), 622 states have internal predecessors, (815), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (81), 46 states have call predecessors, (81), 47 states have call successors, (81) [2022-11-02 20:04:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 950 transitions. [2022-11-02 20:04:26,108 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 950 transitions. Word has length 39 [2022-11-02 20:04:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:26,108 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 950 transitions. [2022-11-02 20:04:26,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 950 transitions. [2022-11-02 20:04:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:04:26,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:26,112 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] [2022-11-02 20:04:26,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:04:26,113 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2104766079, now seen corresponding path program 1 times [2022-11-02 20:04:26,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:26,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91907121] [2022-11-02 20:04:26,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91907121] [2022-11-02 20:04:26,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91907121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:26,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:26,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395419642] [2022-11-02 20:04:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:26,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:26,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:26,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:26,261 INFO L87 Difference]: Start difference. First operand 691 states and 950 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:26,837 INFO L93 Difference]: Finished difference Result 731 states and 996 transitions. [2022-11-02 20:04:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:04:26,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:04:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:26,841 INFO L225 Difference]: With dead ends: 731 [2022-11-02 20:04:26,841 INFO L226 Difference]: Without dead ends: 711 [2022-11-02 20:04:26,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:26,843 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 84 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:26,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1751 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-02 20:04:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 696. [2022-11-02 20:04:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 615 states have (on average 1.3317073170731708) internal successors, (819), 626 states have internal predecessors, (819), 54 states have call successors, (54), 23 states have call predecessors, (54), 26 states have return successors, (83), 47 states have call predecessors, (83), 47 states have call successors, (83) [2022-11-02 20:04:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 956 transitions. [2022-11-02 20:04:26,941 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 956 transitions. Word has length 39 [2022-11-02 20:04:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:26,941 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 956 transitions. [2022-11-02 20:04:26,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 956 transitions. [2022-11-02 20:04:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:04:26,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:26,944 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] [2022-11-02 20:04:26,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:04:26,944 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash 225426455, now seen corresponding path program 1 times [2022-11-02 20:04:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:26,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587581315] [2022-11-02 20:04:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:27,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:27,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587581315] [2022-11-02 20:04:27,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587581315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:27,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:27,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:04:27,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300021820] [2022-11-02 20:04:27,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:27,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:04:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:27,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:04:27,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:27,059 INFO L87 Difference]: Start difference. First operand 696 states and 956 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:27,526 INFO L93 Difference]: Finished difference Result 780 states and 1040 transitions. [2022-11-02 20:04:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:27,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:04:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:27,530 INFO L225 Difference]: With dead ends: 780 [2022-11-02 20:04:27,530 INFO L226 Difference]: Without dead ends: 518 [2022-11-02 20:04:27,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:27,533 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 485 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:27,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 955 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-11-02 20:04:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 477. [2022-11-02 20:04:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 418 states have (on average 1.299043062200957) internal successors, (543), 428 states have internal predecessors, (543), 39 states have call successors, (39), 16 states have call predecessors, (39), 19 states have return successors, (47), 33 states have call predecessors, (47), 32 states have call successors, (47) [2022-11-02 20:04:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 629 transitions. [2022-11-02 20:04:27,604 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 629 transitions. Word has length 41 [2022-11-02 20:04:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:27,605 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 629 transitions. [2022-11-02 20:04:27,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 629 transitions. [2022-11-02 20:04:27,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:04:27,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:27,607 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] [2022-11-02 20:04:27,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:04:27,608 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash -974540775, now seen corresponding path program 1 times [2022-11-02 20:04:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:27,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388352691] [2022-11-02 20:04:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:27,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:27,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:04:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388352691] [2022-11-02 20:04:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388352691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:27,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:27,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827765081] [2022-11-02 20:04:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:27,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:27,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:27,774 INFO L87 Difference]: Start difference. First operand 477 states and 629 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:28,354 INFO L93 Difference]: Finished difference Result 797 states and 1063 transitions. [2022-11-02 20:04:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:04:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:04:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:28,364 INFO L225 Difference]: With dead ends: 797 [2022-11-02 20:04:28,364 INFO L226 Difference]: Without dead ends: 520 [2022-11-02 20:04:28,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:04:28,366 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 458 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:28,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1070 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-11-02 20:04:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 481. [2022-11-02 20:04:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 422 states have (on average 1.2962085308056872) internal successors, (547), 432 states have internal predecessors, (547), 39 states have call successors, (39), 16 states have call predecessors, (39), 19 states have return successors, (47), 33 states have call predecessors, (47), 32 states have call successors, (47) [2022-11-02 20:04:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 633 transitions. [2022-11-02 20:04:28,470 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 633 transitions. Word has length 40 [2022-11-02 20:04:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:28,470 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 633 transitions. [2022-11-02 20:04:28,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 633 transitions. [2022-11-02 20:04:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:04:28,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:28,473 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] [2022-11-02 20:04:28,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:04:28,474 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1588334311, now seen corresponding path program 1 times [2022-11-02 20:04:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:28,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403645937] [2022-11-02 20:04:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:04:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:28,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:28,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403645937] [2022-11-02 20:04:28,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403645937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:28,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:28,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:04:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188080381] [2022-11-02 20:04:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:28,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:04:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:04:28,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:04:28,546 INFO L87 Difference]: Start difference. First operand 481 states and 633 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:28,941 INFO L93 Difference]: Finished difference Result 579 states and 759 transitions. [2022-11-02 20:04:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:04:28,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:04:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:28,945 INFO L225 Difference]: With dead ends: 579 [2022-11-02 20:04:28,946 INFO L226 Difference]: Without dead ends: 509 [2022-11-02 20:04:28,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:28,947 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 180 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:28,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 951 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-11-02 20:04:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 455. [2022-11-02 20:04:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 398 states have (on average 1.3115577889447236) internal successors, (522), 409 states have internal predecessors, (522), 38 states have call successors, (38), 15 states have call predecessors, (38), 18 states have return successors, (47), 31 states have call predecessors, (47), 31 states have call successors, (47) [2022-11-02 20:04:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 607 transitions. [2022-11-02 20:04:29,026 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 607 transitions. Word has length 40 [2022-11-02 20:04:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:29,027 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 607 transitions. [2022-11-02 20:04:29,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 607 transitions. [2022-11-02 20:04:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:04:29,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:29,029 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] [2022-11-02 20:04:29,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:04:29,029 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1541633835, now seen corresponding path program 1 times [2022-11-02 20:04:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:29,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730097362] [2022-11-02 20:04:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:04:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:29,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730097362] [2022-11-02 20:04:29,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730097362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:29,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:29,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:04:29,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182570217] [2022-11-02 20:04:29,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:04:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:04:29,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:29,213 INFO L87 Difference]: Start difference. First operand 455 states and 607 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:29,790 INFO L93 Difference]: Finished difference Result 503 states and 673 transitions. [2022-11-02 20:04:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:04:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:29,794 INFO L225 Difference]: With dead ends: 503 [2022-11-02 20:04:29,794 INFO L226 Difference]: Without dead ends: 499 [2022-11-02 20:04:29,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:04:29,795 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 287 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:29,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1801 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-02 20:04:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 470. [2022-11-02 20:04:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 412 states have (on average 1.3009708737864079) internal successors, (536), 423 states have internal predecessors, (536), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (55), 32 states have call predecessors, (55), 31 states have call successors, (55) [2022-11-02 20:04:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 629 transitions. [2022-11-02 20:04:29,872 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 629 transitions. Word has length 41 [2022-11-02 20:04:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:29,872 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 629 transitions. [2022-11-02 20:04:29,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2022-11-02 20:04:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:04:29,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:29,875 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] [2022-11-02 20:04:29,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:04:29,875 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:29,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1541357005, now seen corresponding path program 1 times [2022-11-02 20:04:29,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:29,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572936467] [2022-11-02 20:04:29,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:04:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:30,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572936467] [2022-11-02 20:04:30,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572936467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:30,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:30,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:04:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841017096] [2022-11-02 20:04:30,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:30,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:04:30,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:30,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:04:30,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:30,007 INFO L87 Difference]: Start difference. First operand 470 states and 629 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:30,619 INFO L93 Difference]: Finished difference Result 490 states and 650 transitions. [2022-11-02 20:04:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:30,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:04:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:30,624 INFO L225 Difference]: With dead ends: 490 [2022-11-02 20:04:30,624 INFO L226 Difference]: Without dead ends: 477 [2022-11-02 20:04:30,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:30,625 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 78 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:30,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1943 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-11-02 20:04:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 467. [2022-11-02 20:04:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 409 states have (on average 1.3031784841075795) internal successors, (533), 421 states have internal predecessors, (533), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (54), 31 states have call predecessors, (54), 31 states have call successors, (54) [2022-11-02 20:04:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 625 transitions. [2022-11-02 20:04:30,755 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 625 transitions. Word has length 41 [2022-11-02 20:04:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:30,756 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 625 transitions. [2022-11-02 20:04:30,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 625 transitions. [2022-11-02 20:04:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:04:30,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:30,762 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] [2022-11-02 20:04:30,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:04:30,763 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash -681787036, now seen corresponding path program 1 times [2022-11-02 20:04:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:30,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310578360] [2022-11-02 20:04:30,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:30,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:04:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:30,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:30,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310578360] [2022-11-02 20:04:30,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310578360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:30,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:30,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:30,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134531680] [2022-11-02 20:04:30,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:30,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:30,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:30,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:30,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:30,934 INFO L87 Difference]: Start difference. First operand 467 states and 625 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:31,571 INFO L93 Difference]: Finished difference Result 527 states and 699 transitions. [2022-11-02 20:04:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:31,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-02 20:04:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:31,577 INFO L225 Difference]: With dead ends: 527 [2022-11-02 20:04:31,577 INFO L226 Difference]: Without dead ends: 511 [2022-11-02 20:04:31,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:04:31,579 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 603 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:31,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1107 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-11-02 20:04:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 453. [2022-11-02 20:04:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 397 states have (on average 1.309823677581864) internal successors, (520), 408 states have internal predecessors, (520), 37 states have call successors, (37), 15 states have call predecessors, (37), 18 states have return successors, (46), 30 states have call predecessors, (46), 30 states have call successors, (46) [2022-11-02 20:04:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2022-11-02 20:04:31,664 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 42 [2022-11-02 20:04:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:31,664 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2022-11-02 20:04:31,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2022-11-02 20:04:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:04:31,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:31,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:31,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:04:31,669 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1773882886, now seen corresponding path program 1 times [2022-11-02 20:04:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:31,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5928025] [2022-11-02 20:04:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:31,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5928025] [2022-11-02 20:04:31,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5928025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:31,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:31,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905106836] [2022-11-02 20:04:31,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:31,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:31,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:31,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:31,958 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:32,419 INFO L93 Difference]: Finished difference Result 653 states and 873 transitions. [2022-11-02 20:04:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:04:32,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:04:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:32,421 INFO L225 Difference]: With dead ends: 653 [2022-11-02 20:04:32,422 INFO L226 Difference]: Without dead ends: 413 [2022-11-02 20:04:32,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:32,423 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 102 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:32,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1755 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-02 20:04:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2022-11-02 20:04:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 364 states have internal predecessors, (461), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (41), 29 states have call predecessors, (41), 29 states have call successors, (41) [2022-11-02 20:04:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 537 transitions. [2022-11-02 20:04:32,510 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 537 transitions. Word has length 44 [2022-11-02 20:04:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:32,510 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 537 transitions. [2022-11-02 20:04:32,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 537 transitions. [2022-11-02 20:04:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:04:32,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:32,512 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] [2022-11-02 20:04:32,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:04:32,513 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash -126970977, now seen corresponding path program 1 times [2022-11-02 20:04:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:32,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195826568] [2022-11-02 20:04:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:32,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195826568] [2022-11-02 20:04:32,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195826568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:32,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:32,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265699890] [2022-11-02 20:04:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:32,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:32,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:32,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:32,680 INFO L87 Difference]: Start difference. First operand 407 states and 537 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:33,227 INFO L93 Difference]: Finished difference Result 607 states and 802 transitions. [2022-11-02 20:04:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:33,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-02 20:04:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:33,230 INFO L225 Difference]: With dead ends: 607 [2022-11-02 20:04:33,231 INFO L226 Difference]: Without dead ends: 413 [2022-11-02 20:04:33,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:33,232 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 397 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:33,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1031 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-02 20:04:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2022-11-02 20:04:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2857142857142858) internal successors, (459), 364 states have internal predecessors, (459), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (41), 29 states have call predecessors, (41), 29 states have call successors, (41) [2022-11-02 20:04:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 535 transitions. [2022-11-02 20:04:33,321 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 535 transitions. Word has length 46 [2022-11-02 20:04:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:33,321 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 535 transitions. [2022-11-02 20:04:33,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 535 transitions. [2022-11-02 20:04:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:04:33,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:33,323 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] [2022-11-02 20:04:33,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:04:33,324 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1699061038, now seen corresponding path program 1 times [2022-11-02 20:04:33,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:33,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107276470] [2022-11-02 20:04:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:33,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:04:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:33,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107276470] [2022-11-02 20:04:33,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107276470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:33,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:33,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:04:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503559729] [2022-11-02 20:04:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:33,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:04:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:04:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:33,470 INFO L87 Difference]: Start difference. First operand 407 states and 535 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:34,066 INFO L93 Difference]: Finished difference Result 425 states and 553 transitions. [2022-11-02 20:04:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:34,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-02 20:04:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:34,070 INFO L225 Difference]: With dead ends: 425 [2022-11-02 20:04:34,070 INFO L226 Difference]: Without dead ends: 409 [2022-11-02 20:04:34,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:34,073 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 74 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:34,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1936 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-02 20:04:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2022-11-02 20:04:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 354 states have (on average 1.2853107344632768) internal successors, (455), 361 states have internal predecessors, (455), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (40), 28 states have call predecessors, (40), 28 states have call successors, (40) [2022-11-02 20:04:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 529 transitions. [2022-11-02 20:04:34,151 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 529 transitions. Word has length 46 [2022-11-02 20:04:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:34,152 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 529 transitions. [2022-11-02 20:04:34,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 529 transitions. [2022-11-02 20:04:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:04:34,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:34,154 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] [2022-11-02 20:04:34,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:04:34,154 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:34,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:34,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1266428222, now seen corresponding path program 1 times [2022-11-02 20:04:34,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:34,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12263215] [2022-11-02 20:04:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:04:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:34,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12263215] [2022-11-02 20:04:34,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12263215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:34,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:34,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133156559] [2022-11-02 20:04:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:34,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:34,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:34,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:34,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:34,320 INFO L87 Difference]: Start difference. First operand 403 states and 529 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:35,168 INFO L93 Difference]: Finished difference Result 425 states and 552 transitions. [2022-11-02 20:04:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:04:35,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-11-02 20:04:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:35,171 INFO L225 Difference]: With dead ends: 425 [2022-11-02 20:04:35,187 INFO L226 Difference]: Without dead ends: 404 [2022-11-02 20:04:35,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:04:35,188 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 148 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:35,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1872 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:04:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-11-02 20:04:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 398. [2022-11-02 20:04:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 349 states have (on average 1.2836676217765044) internal successors, (448), 357 states have internal predecessors, (448), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (39), 27 states have call predecessors, (39), 28 states have call successors, (39) [2022-11-02 20:04:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 521 transitions. [2022-11-02 20:04:35,279 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 521 transitions. Word has length 47 [2022-11-02 20:04:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:35,280 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 521 transitions. [2022-11-02 20:04:35,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 521 transitions. [2022-11-02 20:04:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:04:35,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:35,282 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] [2022-11-02 20:04:35,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:04:35,282 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1875666142, now seen corresponding path program 1 times [2022-11-02 20:04:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:35,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364258675] [2022-11-02 20:04:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:04:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:35,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:35,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364258675] [2022-11-02 20:04:35,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364258675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:35,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:35,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874261586] [2022-11-02 20:04:35,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:35,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:35,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:35,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:35,396 INFO L87 Difference]: Start difference. First operand 398 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:36,093 INFO L93 Difference]: Finished difference Result 421 states and 545 transitions. [2022-11-02 20:04:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:04:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-02 20:04:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:36,097 INFO L225 Difference]: With dead ends: 421 [2022-11-02 20:04:36,097 INFO L226 Difference]: Without dead ends: 403 [2022-11-02 20:04:36,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:36,098 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 148 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:36,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1389 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-02 20:04:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 397. [2022-11-02 20:04:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 349 states have (on average 1.2808022922636104) internal successors, (447), 356 states have internal predecessors, (447), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (38), 27 states have call predecessors, (38), 27 states have call successors, (38) [2022-11-02 20:04:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 518 transitions. [2022-11-02 20:04:36,172 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 518 transitions. Word has length 48 [2022-11-02 20:04:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:36,173 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 518 transitions. [2022-11-02 20:04:36,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 518 transitions. [2022-11-02 20:04:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:04:36,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:36,175 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] [2022-11-02 20:04:36,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:04:36,175 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash 712165053, now seen corresponding path program 1 times [2022-11-02 20:04:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:36,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577271792] [2022-11-02 20:04:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:36,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:36,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577271792] [2022-11-02 20:04:36,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577271792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:36,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:36,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:04:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253827026] [2022-11-02 20:04:36,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:36,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:04:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:04:36,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:04:36,277 INFO L87 Difference]: Start difference. First operand 397 states and 518 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:36,615 INFO L93 Difference]: Finished difference Result 670 states and 869 transitions. [2022-11-02 20:04:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:04:36,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-11-02 20:04:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:36,619 INFO L225 Difference]: With dead ends: 670 [2022-11-02 20:04:36,619 INFO L226 Difference]: Without dead ends: 482 [2022-11-02 20:04:36,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:36,621 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 188 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:36,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 859 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:04:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-02 20:04:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2022-11-02 20:04:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 397 states have (on average 1.279596977329975) internal successors, (508), 403 states have internal predecessors, (508), 35 states have call successors, (35), 16 states have call predecessors, (35), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2022-11-02 20:04:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 587 transitions. [2022-11-02 20:04:36,704 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 587 transitions. Word has length 49 [2022-11-02 20:04:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:36,705 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 587 transitions. [2022-11-02 20:04:36,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 587 transitions. [2022-11-02 20:04:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:04:36,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:36,707 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] [2022-11-02 20:04:36,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:04:36,708 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1620758026, now seen corresponding path program 1 times [2022-11-02 20:04:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:36,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804561352] [2022-11-02 20:04:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:36,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:36,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804561352] [2022-11-02 20:04:36,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804561352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:36,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:36,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:04:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088155400] [2022-11-02 20:04:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:36,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:04:36,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:36,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:04:36,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:04:36,816 INFO L87 Difference]: Start difference. First operand 450 states and 587 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:37,189 INFO L93 Difference]: Finished difference Result 549 states and 702 transitions. [2022-11-02 20:04:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:04:37,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 20:04:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:37,192 INFO L225 Difference]: With dead ends: 549 [2022-11-02 20:04:37,193 INFO L226 Difference]: Without dead ends: 463 [2022-11-02 20:04:37,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:37,194 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 70 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:37,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1065 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-11-02 20:04:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 452. [2022-11-02 20:04:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.2781954887218046) internal successors, (510), 405 states have internal predecessors, (510), 35 states have call successors, (35), 16 states have call predecessors, (35), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2022-11-02 20:04:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 589 transitions. [2022-11-02 20:04:37,279 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 589 transitions. Word has length 48 [2022-11-02 20:04:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:37,280 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 589 transitions. [2022-11-02 20:04:37,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 589 transitions. [2022-11-02 20:04:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:04:37,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:37,282 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] [2022-11-02 20:04:37,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:04:37,282 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash -979201482, now seen corresponding path program 1 times [2022-11-02 20:04:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:37,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561982089] [2022-11-02 20:04:37,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:37,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:37,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:37,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561982089] [2022-11-02 20:04:37,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561982089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:37,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:37,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:04:37,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077410353] [2022-11-02 20:04:37,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:37,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:04:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:37,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:04:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:37,442 INFO L87 Difference]: Start difference. First operand 452 states and 589 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:37,983 INFO L93 Difference]: Finished difference Result 473 states and 609 transitions. [2022-11-02 20:04:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:37,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 20:04:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:37,986 INFO L225 Difference]: With dead ends: 473 [2022-11-02 20:04:37,987 INFO L226 Difference]: Without dead ends: 451 [2022-11-02 20:04:37,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:37,988 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 81 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:37,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1815 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-11-02 20:04:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 440. [2022-11-02 20:04:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 388 states have (on average 1.2731958762886597) internal successors, (494), 393 states have internal predecessors, (494), 34 states have call successors, (34), 16 states have call predecessors, (34), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2022-11-02 20:04:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 572 transitions. [2022-11-02 20:04:38,069 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 572 transitions. Word has length 48 [2022-11-02 20:04:38,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:38,069 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 572 transitions. [2022-11-02 20:04:38,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 572 transitions. [2022-11-02 20:04:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:04:38,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:38,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:38,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:04:38,072 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash -697229217, now seen corresponding path program 1 times [2022-11-02 20:04:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:38,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638859208] [2022-11-02 20:04:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:38,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:04:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:38,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:38,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638859208] [2022-11-02 20:04:38,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638859208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:38,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:38,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940027883] [2022-11-02 20:04:38,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:38,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:38,329 INFO L87 Difference]: Start difference. First operand 440 states and 572 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:38,899 INFO L93 Difference]: Finished difference Result 690 states and 898 transitions. [2022-11-02 20:04:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:04:38,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-11-02 20:04:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:38,902 INFO L225 Difference]: With dead ends: 690 [2022-11-02 20:04:38,903 INFO L226 Difference]: Without dead ends: 469 [2022-11-02 20:04:38,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:38,905 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 81 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:38,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1775 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-11-02 20:04:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 440. [2022-11-02 20:04:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 388 states have (on average 1.268041237113402) internal successors, (492), 393 states have internal predecessors, (492), 34 states have call successors, (34), 16 states have call predecessors, (34), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2022-11-02 20:04:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 570 transitions. [2022-11-02 20:04:38,989 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 570 transitions. Word has length 51 [2022-11-02 20:04:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:38,989 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 570 transitions. [2022-11-02 20:04:38,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 570 transitions. [2022-11-02 20:04:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:04:38,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:38,994 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] [2022-11-02 20:04:38,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:04:38,995 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1011871155, now seen corresponding path program 1 times [2022-11-02 20:04:38,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:38,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140247466] [2022-11-02 20:04:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:38,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:04:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:39,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:39,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140247466] [2022-11-02 20:04:39,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140247466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:39,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:39,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695336177] [2022-11-02 20:04:39,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:39,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:39,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:39,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:39,133 INFO L87 Difference]: Start difference. First operand 440 states and 570 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:39,685 INFO L93 Difference]: Finished difference Result 461 states and 592 transitions. [2022-11-02 20:04:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:04:39,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-11-02 20:04:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:39,688 INFO L225 Difference]: With dead ends: 461 [2022-11-02 20:04:39,688 INFO L226 Difference]: Without dead ends: 442 [2022-11-02 20:04:39,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:04:39,690 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 82 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:39,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2040 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-02 20:04:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2022-11-02 20:04:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 385 states have (on average 1.2675324675324675) internal successors, (488), 390 states have internal predecessors, (488), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (43), 30 states have call predecessors, (43), 29 states have call successors, (43) [2022-11-02 20:04:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 564 transitions. [2022-11-02 20:04:39,771 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 564 transitions. Word has length 51 [2022-11-02 20:04:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:39,771 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 564 transitions. [2022-11-02 20:04:39,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 564 transitions. [2022-11-02 20:04:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:04:39,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:39,774 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] [2022-11-02 20:04:39,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:04:39,774 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1800703409, now seen corresponding path program 1 times [2022-11-02 20:04:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:39,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770234654] [2022-11-02 20:04:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:04:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:39,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770234654] [2022-11-02 20:04:39,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770234654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:39,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:39,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036831772] [2022-11-02 20:04:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:39,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:39,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:39,916 INFO L87 Difference]: Start difference. First operand 436 states and 564 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:40,450 INFO L93 Difference]: Finished difference Result 457 states and 586 transitions. [2022-11-02 20:04:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:04:40,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-11-02 20:04:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:40,454 INFO L225 Difference]: With dead ends: 457 [2022-11-02 20:04:40,454 INFO L226 Difference]: Without dead ends: 437 [2022-11-02 20:04:40,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:04:40,455 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 82 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:40,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2002 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-02 20:04:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 431. [2022-11-02 20:04:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 381 states have (on average 1.2677165354330708) internal successors, (483), 386 states have internal predecessors, (483), 32 states have call successors, (32), 16 states have call predecessors, (32), 17 states have return successors, (42), 29 states have call predecessors, (42), 28 states have call successors, (42) [2022-11-02 20:04:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 557 transitions. [2022-11-02 20:04:40,534 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 557 transitions. Word has length 52 [2022-11-02 20:04:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:40,535 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 557 transitions. [2022-11-02 20:04:40,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 557 transitions. [2022-11-02 20:04:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:04:40,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:40,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:40,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:04:40,537 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1557824811, now seen corresponding path program 1 times [2022-11-02 20:04:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:40,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118618042] [2022-11-02 20:04:40,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:04:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:40,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:40,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118618042] [2022-11-02 20:04:40,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118618042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:40,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:40,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886094375] [2022-11-02 20:04:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:40,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:40,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:40,679 INFO L87 Difference]: Start difference. First operand 431 states and 557 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:41,268 INFO L93 Difference]: Finished difference Result 452 states and 579 transitions. [2022-11-02 20:04:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:04:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-11-02 20:04:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:41,271 INFO L225 Difference]: With dead ends: 452 [2022-11-02 20:04:41,272 INFO L226 Difference]: Without dead ends: 433 [2022-11-02 20:04:41,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:04:41,273 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 82 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:41,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1956 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-02 20:04:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2022-11-02 20:04:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 378 states have (on average 1.2671957671957672) internal successors, (479), 383 states have internal predecessors, (479), 31 states have call successors, (31), 16 states have call predecessors, (31), 17 states have return successors, (41), 28 states have call predecessors, (41), 27 states have call successors, (41) [2022-11-02 20:04:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 551 transitions. [2022-11-02 20:04:41,353 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 551 transitions. Word has length 52 [2022-11-02 20:04:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:41,353 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 551 transitions. [2022-11-02 20:04:41,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 551 transitions. [2022-11-02 20:04:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:04:41,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:41,356 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] [2022-11-02 20:04:41,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:04:41,356 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:41,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:41,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1863063646, now seen corresponding path program 1 times [2022-11-02 20:04:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:41,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122416135] [2022-11-02 20:04:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:41,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:04:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:41,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122416135] [2022-11-02 20:04:41,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122416135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:41,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:41,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:04:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822202168] [2022-11-02 20:04:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:41,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:04:41,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:41,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:04:41,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:41,502 INFO L87 Difference]: Start difference. First operand 427 states and 551 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:42,016 INFO L93 Difference]: Finished difference Result 444 states and 568 transitions. [2022-11-02 20:04:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-11-02 20:04:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:42,019 INFO L225 Difference]: With dead ends: 444 [2022-11-02 20:04:42,020 INFO L226 Difference]: Without dead ends: 424 [2022-11-02 20:04:42,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:42,021 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 72 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:42,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1778 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-11-02 20:04:42,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 418. [2022-11-02 20:04:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2648648648648648) internal successors, (468), 375 states have internal predecessors, (468), 30 states have call successors, (30), 16 states have call predecessors, (30), 17 states have return successors, (40), 27 states have call predecessors, (40), 26 states have call successors, (40) [2022-11-02 20:04:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 538 transitions. [2022-11-02 20:04:42,097 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 538 transitions. Word has length 52 [2022-11-02 20:04:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:42,097 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 538 transitions. [2022-11-02 20:04:42,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 538 transitions. [2022-11-02 20:04:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:04:42,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:42,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:42,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:04:42,100 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1043047530, now seen corresponding path program 1 times [2022-11-02 20:04:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:42,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396868238] [2022-11-02 20:04:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:42,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:42,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396868238] [2022-11-02 20:04:42,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396868238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:42,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:42,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708490351] [2022-11-02 20:04:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:42,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:42,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:42,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:42,331 INFO L87 Difference]: Start difference. First operand 418 states and 538 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:42,845 INFO L93 Difference]: Finished difference Result 760 states and 992 transitions. [2022-11-02 20:04:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:04:42,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-11-02 20:04:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:42,849 INFO L225 Difference]: With dead ends: 760 [2022-11-02 20:04:42,849 INFO L226 Difference]: Without dead ends: 550 [2022-11-02 20:04:42,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:42,862 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 133 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:42,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1884 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-02 20:04:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 418. [2022-11-02 20:04:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2621621621621621) internal successors, (467), 375 states have internal predecessors, (467), 30 states have call successors, (30), 16 states have call predecessors, (30), 17 states have return successors, (40), 27 states have call predecessors, (40), 26 states have call successors, (40) [2022-11-02 20:04:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 537 transitions. [2022-11-02 20:04:42,949 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 537 transitions. Word has length 54 [2022-11-02 20:04:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:42,951 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 537 transitions. [2022-11-02 20:04:42,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 537 transitions. [2022-11-02 20:04:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:04:42,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:42,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:42,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:04:42,957 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1077241075, now seen corresponding path program 1 times [2022-11-02 20:04:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:42,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023904775] [2022-11-02 20:04:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:04:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:43,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023904775] [2022-11-02 20:04:43,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023904775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:43,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:43,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:04:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397342455] [2022-11-02 20:04:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:43,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:04:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:04:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:43,154 INFO L87 Difference]: Start difference. First operand 418 states and 537 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:44,007 INFO L93 Difference]: Finished difference Result 437 states and 556 transitions. [2022-11-02 20:04:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:04:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-11-02 20:04:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:44,011 INFO L225 Difference]: With dead ends: 437 [2022-11-02 20:04:44,011 INFO L226 Difference]: Without dead ends: 390 [2022-11-02 20:04:44,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:04:44,012 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 137 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:44,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1798 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:04:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-02 20:04:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 382. [2022-11-02 20:04:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 338 states have (on average 1.257396449704142) internal successors, (425), 342 states have internal predecessors, (425), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (37), 25 states have call predecessors, (37), 24 states have call successors, (37) [2022-11-02 20:04:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 490 transitions. [2022-11-02 20:04:44,091 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 490 transitions. Word has length 56 [2022-11-02 20:04:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:44,092 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 490 transitions. [2022-11-02 20:04:44,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 490 transitions. [2022-11-02 20:04:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:04:44,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:44,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:44,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:04:44,095 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:44,095 INFO L85 PathProgramCache]: Analyzing trace with hash 843934500, now seen corresponding path program 1 times [2022-11-02 20:04:44,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:44,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307887541] [2022-11-02 20:04:44,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:44,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:44,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:04:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:44,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:44,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307887541] [2022-11-02 20:04:44,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307887541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:44,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:44,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:44,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315531953] [2022-11-02 20:04:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:44,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:44,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:44,241 INFO L87 Difference]: Start difference. First operand 382 states and 490 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:44,788 INFO L93 Difference]: Finished difference Result 403 states and 512 transitions. [2022-11-02 20:04:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:04:44,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-11-02 20:04:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:44,791 INFO L225 Difference]: With dead ends: 403 [2022-11-02 20:04:44,791 INFO L226 Difference]: Without dead ends: 366 [2022-11-02 20:04:44,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:04:44,794 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 90 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:44,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1547 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-02 20:04:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 360. [2022-11-02 20:04:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.2570532915360502) internal successors, (401), 323 states have internal predecessors, (401), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (35), 23 states have call predecessors, (35), 22 states have call successors, (35) [2022-11-02 20:04:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 462 transitions. [2022-11-02 20:04:44,866 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 462 transitions. Word has length 56 [2022-11-02 20:04:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:44,866 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 462 transitions. [2022-11-02 20:04:44,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:04:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 462 transitions. [2022-11-02 20:04:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:04:44,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:44,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:44,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:04:44,869 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1757413827, now seen corresponding path program 1 times [2022-11-02 20:04:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:44,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160243830] [2022-11-02 20:04:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:44,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:04:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:44,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:44,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160243830] [2022-11-02 20:04:44,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160243830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:44,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:44,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128572637] [2022-11-02 20:04:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:44,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:44,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:44,997 INFO L87 Difference]: Start difference. First operand 360 states and 462 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:45,426 INFO L93 Difference]: Finished difference Result 572 states and 729 transitions. [2022-11-02 20:04:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:04:45,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2022-11-02 20:04:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:45,429 INFO L225 Difference]: With dead ends: 572 [2022-11-02 20:04:45,429 INFO L226 Difference]: Without dead ends: 341 [2022-11-02 20:04:45,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:45,430 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 250 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:45,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 868 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-02 20:04:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 327. [2022-11-02 20:04:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 294 states have internal predecessors, (366), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-11-02 20:04:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 412 transitions. [2022-11-02 20:04:45,498 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 412 transitions. Word has length 62 [2022-11-02 20:04:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:45,499 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 412 transitions. [2022-11-02 20:04:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 412 transitions. [2022-11-02 20:04:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:04:45,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:45,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:45,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:04:45,502 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:45,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash 282061023, now seen corresponding path program 1 times [2022-11-02 20:04:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:45,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461944888] [2022-11-02 20:04:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:45,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:04:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:45,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:45,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461944888] [2022-11-02 20:04:45,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461944888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:45,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:45,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:04:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995222065] [2022-11-02 20:04:45,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:45,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:04:45,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:45,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:04:45,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:45,706 INFO L87 Difference]: Start difference. First operand 327 states and 412 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:46,310 INFO L93 Difference]: Finished difference Result 374 states and 469 transitions. [2022-11-02 20:04:46,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:04:46,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2022-11-02 20:04:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:46,327 INFO L225 Difference]: With dead ends: 374 [2022-11-02 20:04:46,328 INFO L226 Difference]: Without dead ends: 355 [2022-11-02 20:04:46,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:04:46,329 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 353 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:46,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1308 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-02 20:04:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 335. [2022-11-02 20:04:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 298 states have (on average 1.2516778523489933) internal successors, (373), 301 states have internal predecessors, (373), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (26), 21 states have call predecessors, (26), 20 states have call successors, (26) [2022-11-02 20:04:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 422 transitions. [2022-11-02 20:04:46,397 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 422 transitions. Word has length 66 [2022-11-02 20:04:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:46,398 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 422 transitions. [2022-11-02 20:04:46,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 422 transitions. [2022-11-02 20:04:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:04:46,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:46,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:46,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:04:46,400 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1597986012, now seen corresponding path program 1 times [2022-11-02 20:04:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860665047] [2022-11-02 20:04:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:04:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:04:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:46,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860665047] [2022-11-02 20:04:46,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860665047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:46,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:46,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:04:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102916530] [2022-11-02 20:04:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:46,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:04:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:04:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:46,551 INFO L87 Difference]: Start difference. First operand 335 states and 422 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:47,283 INFO L93 Difference]: Finished difference Result 698 states and 856 transitions. [2022-11-02 20:04:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2022-11-02 20:04:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:47,287 INFO L225 Difference]: With dead ends: 698 [2022-11-02 20:04:47,287 INFO L226 Difference]: Without dead ends: 454 [2022-11-02 20:04:47,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:04:47,289 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 485 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:47,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1216 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-02 20:04:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 429. [2022-11-02 20:04:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 382 states have (on average 1.2408376963350785) internal successors, (474), 387 states have internal predecessors, (474), 25 states have call successors, (25), 19 states have call predecessors, (25), 21 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2022-11-02 20:04:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 527 transitions. [2022-11-02 20:04:47,378 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 527 transitions. Word has length 68 [2022-11-02 20:04:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:47,379 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 527 transitions. [2022-11-02 20:04:47,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 527 transitions. [2022-11-02 20:04:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:04:47,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:47,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:47,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:04:47,381 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:47,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2100257904, now seen corresponding path program 1 times [2022-11-02 20:04:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:47,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081962906] [2022-11-02 20:04:47,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:04:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:04:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:47,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:47,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081962906] [2022-11-02 20:04:47,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081962906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:47,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:47,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:04:47,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478229149] [2022-11-02 20:04:47,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:47,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:04:47,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:47,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:04:47,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:47,687 INFO L87 Difference]: Start difference. First operand 429 states and 527 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:48,259 INFO L93 Difference]: Finished difference Result 462 states and 562 transitions. [2022-11-02 20:04:48,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:04:48,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2022-11-02 20:04:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:48,262 INFO L225 Difference]: With dead ends: 462 [2022-11-02 20:04:48,263 INFO L226 Difference]: Without dead ends: 443 [2022-11-02 20:04:48,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:04:48,264 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 152 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:48,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1563 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-02 20:04:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 421. [2022-11-02 20:04:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 375 states have (on average 1.2426666666666666) internal successors, (466), 380 states have internal predecessors, (466), 25 states have call successors, (25), 19 states have call predecessors, (25), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2022-11-02 20:04:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 517 transitions. [2022-11-02 20:04:48,367 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 517 transitions. Word has length 67 [2022-11-02 20:04:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:48,368 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 517 transitions. [2022-11-02 20:04:48,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 517 transitions. [2022-11-02 20:04:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 20:04:48,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:48,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:48,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 20:04:48,373 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1162614473, now seen corresponding path program 1 times [2022-11-02 20:04:48,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:48,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120402543] [2022-11-02 20:04:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:04:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:04:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:04:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:48,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:48,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120402543] [2022-11-02 20:04:48,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120402543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:48,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:48,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:04:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213906135] [2022-11-02 20:04:48,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:48,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:04:48,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:48,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:04:48,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:04:48,583 INFO L87 Difference]: Start difference. First operand 421 states and 517 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:04:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:49,468 INFO L93 Difference]: Finished difference Result 423 states and 518 transitions. [2022-11-02 20:04:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:04:49,469 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2022-11-02 20:04:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:49,471 INFO L225 Difference]: With dead ends: 423 [2022-11-02 20:04:49,471 INFO L226 Difference]: Without dead ends: 346 [2022-11-02 20:04:49,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:04:49,472 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 193 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:49,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1384 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:04:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-11-02 20:04:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-11-02 20:04:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 307 states have (on average 1.247557003257329) internal successors, (383), 311 states have internal predecessors, (383), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 20:04:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 427 transitions. [2022-11-02 20:04:49,550 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 427 transitions. Word has length 69 [2022-11-02 20:04:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:49,550 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 427 transitions. [2022-11-02 20:04:49,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:04:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 427 transitions. [2022-11-02 20:04:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:04:49,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:49,553 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] [2022-11-02 20:04:49,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:04:49,553 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2112644440, now seen corresponding path program 1 times [2022-11-02 20:04:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367066268] [2022-11-02 20:04:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:49,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:49,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:04:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367066268] [2022-11-02 20:04:49,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367066268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:49,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:49,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760730564] [2022-11-02 20:04:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:49,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:49,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:49,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:49,739 INFO L87 Difference]: Start difference. First operand 346 states and 427 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:50,143 INFO L93 Difference]: Finished difference Result 504 states and 620 transitions. [2022-11-02 20:04:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-11-02 20:04:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:50,148 INFO L225 Difference]: With dead ends: 504 [2022-11-02 20:04:50,148 INFO L226 Difference]: Without dead ends: 373 [2022-11-02 20:04:50,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:04:50,149 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 85 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:50,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1209 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:04:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-02 20:04:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 357. [2022-11-02 20:04:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.22397476340694) internal successors, (388), 322 states have internal predecessors, (388), 22 states have call successors, (22), 16 states have call predecessors, (22), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 20:04:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 433 transitions. [2022-11-02 20:04:50,240 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 433 transitions. Word has length 71 [2022-11-02 20:04:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:50,241 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 433 transitions. [2022-11-02 20:04:50,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 433 transitions. [2022-11-02 20:04:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:04:50,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:50,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:04:50,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:04:50,244 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1723775457, now seen corresponding path program 1 times [2022-11-02 20:04:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:50,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918683090] [2022-11-02 20:04:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:50,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:50,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:50,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:04:50,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918683090] [2022-11-02 20:04:50,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918683090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:50,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:50,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:04:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36815225] [2022-11-02 20:04:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:50,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:04:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:04:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:50,454 INFO L87 Difference]: Start difference. First operand 357 states and 433 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:04:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:50,757 INFO L93 Difference]: Finished difference Result 456 states and 556 transitions. [2022-11-02 20:04:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:04:50,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-11-02 20:04:50,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:50,760 INFO L225 Difference]: With dead ends: 456 [2022-11-02 20:04:50,760 INFO L226 Difference]: Without dead ends: 392 [2022-11-02 20:04:50,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:50,763 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 77 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:50,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1208 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:04:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-02 20:04:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 265. [2022-11-02 20:04:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.1794871794871795) internal successors, (276), 238 states have internal predecessors, (276), 16 states have call successors, (16), 12 states have call predecessors, (16), 14 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-02 20:04:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 311 transitions. [2022-11-02 20:04:50,825 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 311 transitions. Word has length 74 [2022-11-02 20:04:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:50,827 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 311 transitions. [2022-11-02 20:04:50,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:04:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 311 transitions. [2022-11-02 20:04:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:04:50,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:50,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:50,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:04:50,829 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:50,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1573659208, now seen corresponding path program 1 times [2022-11-02 20:04:50,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:50,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371106775] [2022-11-02 20:04:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:50,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:04:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:04:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:51,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:51,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371106775] [2022-11-02 20:04:51,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371106775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:51,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:51,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291209960] [2022-11-02 20:04:51,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:51,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:51,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:51,002 INFO L87 Difference]: Start difference. First operand 265 states and 311 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:51,696 INFO L93 Difference]: Finished difference Result 497 states and 582 transitions. [2022-11-02 20:04:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:04:51,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-11-02 20:04:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:51,701 INFO L225 Difference]: With dead ends: 497 [2022-11-02 20:04:51,701 INFO L226 Difference]: Without dead ends: 444 [2022-11-02 20:04:51,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:04:51,702 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 370 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:51,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1461 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:04:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-02 20:04:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 191. [2022-11-02 20:04:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 173 states have internal predecessors, (198), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:04:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2022-11-02 20:04:51,757 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 77 [2022-11-02 20:04:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:51,757 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2022-11-02 20:04:51,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2022-11-02 20:04:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:04:51,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:51,759 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] [2022-11-02 20:04:51,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:04:51,760 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1441970232, now seen corresponding path program 1 times [2022-11-02 20:04:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:51,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057709924] [2022-11-02 20:04:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:51,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:04:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:51,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057709924] [2022-11-02 20:04:51,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057709924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:51,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:51,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971094268] [2022-11-02 20:04:51,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:51,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:51,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:51,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:51,867 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:52,060 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2022-11-02 20:04:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2022-11-02 20:04:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:52,061 INFO L225 Difference]: With dead ends: 256 [2022-11-02 20:04:52,062 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:04:52,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:52,063 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:52,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 507 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:04:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2022-11-02 20:04:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.152046783625731) internal successors, (197), 173 states have internal predecessors, (197), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:04:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2022-11-02 20:04:52,113 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 83 [2022-11-02 20:04:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:52,114 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2022-11-02 20:04:52,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:04:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2022-11-02 20:04:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:04:52,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:52,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:04:52,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:04:52,117 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:52,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:52,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1573344441, now seen corresponding path program 1 times [2022-11-02 20:04:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:52,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862274839] [2022-11-02 20:04:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:04:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:04:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:52,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862274839] [2022-11-02 20:04:52,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862274839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:52,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:52,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102673637] [2022-11-02 20:04:52,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:52,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:52,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:52,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:52,266 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:52,465 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2022-11-02 20:04:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:52,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2022-11-02 20:04:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:52,467 INFO L225 Difference]: With dead ends: 247 [2022-11-02 20:04:52,467 INFO L226 Difference]: Without dead ends: 221 [2022-11-02 20:04:52,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:04:52,468 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 47 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:52,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 681 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-02 20:04:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2022-11-02 20:04:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 173 states have (on average 1.1502890173410405) internal successors, (199), 175 states have internal predecessors, (199), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:04:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2022-11-02 20:04:52,520 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 103 [2022-11-02 20:04:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:52,521 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2022-11-02 20:04:52,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2022-11-02 20:04:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:04:52,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:52,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:04:52,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:04:52,523 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -696614137, now seen corresponding path program 1 times [2022-11-02 20:04:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:52,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371050311] [2022-11-02 20:04:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:04:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:04:52,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:52,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371050311] [2022-11-02 20:04:52,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371050311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:52,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:52,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:04:52,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283823115] [2022-11-02 20:04:52,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:52,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:04:52,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:52,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:04:52,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:52,800 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:53,197 INFO L93 Difference]: Finished difference Result 233 states and 264 transitions. [2022-11-02 20:04:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:04:53,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2022-11-02 20:04:53,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:53,200 INFO L225 Difference]: With dead ends: 233 [2022-11-02 20:04:53,200 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:04:53,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:04:53,201 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 283 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:53,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 921 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:04:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2022-11-02 20:04:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 173 states have internal predecessors, (195), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:04:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions. [2022-11-02 20:04:53,253 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 103 [2022-11-02 20:04:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:53,254 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 214 transitions. [2022-11-02 20:04:53,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions. [2022-11-02 20:04:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:04:53,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:53,256 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:04:53,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:04:53,256 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:53,257 INFO L85 PathProgramCache]: Analyzing trace with hash 561522837, now seen corresponding path program 1 times [2022-11-02 20:04:53,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:53,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768729318] [2022-11-02 20:04:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:53,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:04:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:04:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768729318] [2022-11-02 20:04:53,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768729318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:53,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:53,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:04:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527324562] [2022-11-02 20:04:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:53,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:04:53,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:04:53,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:04:53,667 INFO L87 Difference]: Start difference. First operand 191 states and 214 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:54,380 INFO L93 Difference]: Finished difference Result 299 states and 343 transitions. [2022-11-02 20:04:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:04:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 104 [2022-11-02 20:04:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:54,396 INFO L225 Difference]: With dead ends: 299 [2022-11-02 20:04:54,396 INFO L226 Difference]: Without dead ends: 265 [2022-11-02 20:04:54,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:04:54,397 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 465 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:54,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1442 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:04:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-02 20:04:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 206. [2022-11-02 20:04:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.145945945945946) internal successors, (212), 187 states have internal predecessors, (212), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-02 20:04:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 232 transitions. [2022-11-02 20:04:54,453 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 232 transitions. Word has length 104 [2022-11-02 20:04:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:54,454 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 232 transitions. [2022-11-02 20:04:54,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2022-11-02 20:04:54,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 20:04:54,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:54,456 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:04:54,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:04:54,457 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1183080786, now seen corresponding path program 1 times [2022-11-02 20:04:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:54,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219398383] [2022-11-02 20:04:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:04:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:04:54,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219398383] [2022-11-02 20:04:54,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219398383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:54,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:54,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:04:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128910186] [2022-11-02 20:04:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:54,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:04:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:54,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:04:54,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:04:54,868 INFO L87 Difference]: Start difference. First operand 206 states and 232 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 11 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:55,329 INFO L93 Difference]: Finished difference Result 280 states and 318 transitions. [2022-11-02 20:04:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:04:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 11 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 105 [2022-11-02 20:04:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:55,331 INFO L225 Difference]: With dead ends: 280 [2022-11-02 20:04:55,331 INFO L226 Difference]: Without dead ends: 220 [2022-11-02 20:04:55,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:04:55,332 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 30 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:55,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1674 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-02 20:04:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 206. [2022-11-02 20:04:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.1405405405405404) internal successors, (211), 187 states have internal predecessors, (211), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-02 20:04:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 231 transitions. [2022-11-02 20:04:55,398 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 231 transitions. Word has length 105 [2022-11-02 20:04:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:55,399 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 231 transitions. [2022-11-02 20:04:55,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 11 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 231 transitions. [2022-11-02 20:04:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:04:55,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:55,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:04:55,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:04:55,402 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1392028993, now seen corresponding path program 1 times [2022-11-02 20:04:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:55,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223577818] [2022-11-02 20:04:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:55,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:04:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:04:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223577818] [2022-11-02 20:04:55,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223577818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:55,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:55,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763105851] [2022-11-02 20:04:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:55,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:55,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:55,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:55,569 INFO L87 Difference]: Start difference. First operand 206 states and 231 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:55,770 INFO L93 Difference]: Finished difference Result 258 states and 288 transitions. [2022-11-02 20:04:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:55,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 108 [2022-11-02 20:04:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:55,772 INFO L225 Difference]: With dead ends: 258 [2022-11-02 20:04:55,772 INFO L226 Difference]: Without dead ends: 198 [2022-11-02 20:04:55,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:04:55,773 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 149 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:55,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 384 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-02 20:04:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 184. [2022-11-02 20:04:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.1219512195121952) internal successors, (184), 166 states have internal predecessors, (184), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:04:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2022-11-02 20:04:55,825 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 108 [2022-11-02 20:04:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:55,826 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2022-11-02 20:04:55,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:04:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2022-11-02 20:04:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:04:55,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:55,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:04:55,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:04:55,828 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash 171236406, now seen corresponding path program 1 times [2022-11-02 20:04:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:55,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976694049] [2022-11-02 20:04:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:04:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:04:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:04:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:56,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976694049] [2022-11-02 20:04:56,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976694049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:56,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:56,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616012072] [2022-11-02 20:04:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:56,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:56,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:56,067 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:04:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:56,284 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2022-11-02 20:04:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:04:56,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 114 [2022-11-02 20:04:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:56,285 INFO L225 Difference]: With dead ends: 238 [2022-11-02 20:04:56,286 INFO L226 Difference]: Without dead ends: 163 [2022-11-02 20:04:56,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:04:56,287 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 66 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:56,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 668 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-02 20:04:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-11-02 20:04:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.1095890410958904) internal successors, (162), 147 states have internal predecessors, (162), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-02 20:04:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2022-11-02 20:04:56,340 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 114 [2022-11-02 20:04:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:56,341 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2022-11-02 20:04:56,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:04:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2022-11-02 20:04:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:04:56,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:56,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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 20:04:56,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:04:56,344 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2140745716, now seen corresponding path program 1 times [2022-11-02 20:04:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:56,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445071854] [2022-11-02 20:04:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:04:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:04:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:04:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:56,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445071854] [2022-11-02 20:04:56,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445071854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:56,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:56,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:04:56,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074270478] [2022-11-02 20:04:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:56,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:04:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:04:56,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:04:56,569 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:04:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:56,979 INFO L93 Difference]: Finished difference Result 334 states and 366 transitions. [2022-11-02 20:04:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:04:56,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2022-11-02 20:04:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:56,981 INFO L225 Difference]: With dead ends: 334 [2022-11-02 20:04:56,981 INFO L226 Difference]: Without dead ends: 163 [2022-11-02 20:04:56,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:04:56,982 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 130 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:56,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 808 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:04:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-02 20:04:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-11-02 20:04:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.1027397260273972) internal successors, (161), 147 states have internal predecessors, (161), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-02 20:04:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2022-11-02 20:04:57,034 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 115 [2022-11-02 20:04:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:57,034 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2022-11-02 20:04:57,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:04:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2022-11-02 20:04:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:04:57,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:57,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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 20:04:57,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 20:04:57,038 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash 493382774, now seen corresponding path program 1 times [2022-11-02 20:04:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:57,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801222119] [2022-11-02 20:04:57,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:57,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:04:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:04:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:57,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:04:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:04:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:04:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:57,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801222119] [2022-11-02 20:04:57,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801222119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:57,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:57,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:04:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550510560] [2022-11-02 20:04:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:57,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:04:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:04:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:04:57,380 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 10 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:04:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:57,985 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2022-11-02 20:04:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:04:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 10 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2022-11-02 20:04:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:57,986 INFO L225 Difference]: With dead ends: 176 [2022-11-02 20:04:57,987 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:04:57,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:04:57,988 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 379 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:57,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 750 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:04:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:04:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:04:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:04:57,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2022-11-02 20:04:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:57,989 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:04:57,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 10 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:04:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:04:57,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:04:57,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:04:57,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 20:04:58,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.