./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/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_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/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_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/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 8da39e66c08628aa90e95213e006a92eb0d5a63143d71cc4cdb2dcfa95ff1896 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:00:15,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:00:15,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:00:15,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:00:15,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:00:15,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:00:15,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:00:15,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:00:15,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:00:15,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:00:15,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:00:15,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:00:15,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:00:15,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:00:15,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:00:15,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:00:15,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:00:15,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:00:15,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:00:15,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:00:15,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:00:15,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:00:15,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:00:15,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:00:15,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:00:15,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:00:15,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:00:15,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:00:15,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:00:15,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:00:15,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:00:15,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:00:15,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:00:15,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:00:15,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:00:15,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:00:15,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:00:15,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:00:15,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:00:15,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:00:15,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:00:15,208 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:00:15,243 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:00:15,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:00:15,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:00:15,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:00:15,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:00:15,245 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:00:15,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:00:15,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:00:15,246 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:00:15,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:00:15,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:00:15,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:00:15,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:00:15,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:00:15,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:00:15,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:00:15,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:00:15,249 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:00:15,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:00:15,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:00:15,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:00:15,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:00:15,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:00:15,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:00:15,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:15,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:00:15,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:00:15,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:00:15,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:00:15,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:00:15,252 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:00:15,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:00:15,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:00:15,272 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_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/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_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/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 -> 8da39e66c08628aa90e95213e006a92eb0d5a63143d71cc4cdb2dcfa95ff1896 [2022-11-02 21:00:15,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:00:15,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:00:15,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:00:15,621 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:00:15,626 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:00:15,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c [2022-11-02 21:00:15,731 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/data/b09e7f2c5/261420057879479ebe8731aa3959b440/FLAG3bdecf49e [2022-11-02 21:00:16,306 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:00:16,307 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c [2022-11-02 21:00:16,331 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/data/b09e7f2c5/261420057879479ebe8731aa3959b440/FLAG3bdecf49e [2022-11-02 21:00:16,545 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/data/b09e7f2c5/261420057879479ebe8731aa3959b440 [2022-11-02 21:00:16,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:00:16,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:00:16,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:16,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:00:16,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:00:16,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:16" (1/1) ... [2022-11-02 21:00:16,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40909fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:16, skipping insertion in model container [2022-11-02 21:00:16,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:16" (1/1) ... [2022-11-02 21:00:16,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:00:16,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:00:17,096 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_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c[74369,74382] [2022-11-02 21:00:17,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:17,118 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:00:17,266 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_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c[74369,74382] [2022-11-02 21:00:17,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:17,301 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:00:17,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17 WrapperNode [2022-11-02 21:00:17,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:17,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:17,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:00:17,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:00:17,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,416 INFO L138 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2022-11-02 21:00:17,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:17,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:00:17,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:00:17,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:00:17,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:00:17,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:00:17,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:00:17,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:00:17,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (1/1) ... [2022-11-02 21:00:17,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:17,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:17,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:17,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:00:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:00:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:00:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:00:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:00:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:00:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:00:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:00:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:00:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:00:17,942 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:00:17,945 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:00:17,984 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:00:19,501 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 21:00:19,503 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 21:00:19,504 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:00:19,515 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:00:19,516 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:00:19,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:19 BoogieIcfgContainer [2022-11-02 21:00:19,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:00:19,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:00:19,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:00:19,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:00:19,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:00:16" (1/3) ... [2022-11-02 21:00:19,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c7190f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:19, skipping insertion in model container [2022-11-02 21:00:19,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:17" (2/3) ... [2022-11-02 21:00:19,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c7190f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:19, skipping insertion in model container [2022-11-02 21:00:19,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:19" (3/3) ... [2022-11-02 21:00:19,528 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2022-11-02 21:00:19,558 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:00:19,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:00:19,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:00:19,618 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;@7630f575, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:00:19,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:00:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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 21:00:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 21:00:19,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:19,633 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 21:00:19,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:19,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:19,639 INFO L85 PathProgramCache]: Analyzing trace with hash -442385418, now seen corresponding path program 1 times [2022-11-02 21:00:19,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:19,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491975732] [2022-11-02 21:00:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:20,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:20,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491975732] [2022-11-02 21:00:20,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491975732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:20,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:20,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:20,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303570355] [2022-11-02 21:00:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:20,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:20,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:20,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:20,897 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 21:00:22,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:23,586 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2022-11-02 21:00:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 21:00:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:23,617 INFO L225 Difference]: With dead ends: 421 [2022-11-02 21:00:23,617 INFO L226 Difference]: Without dead ends: 256 [2022-11-02 21:00:23,619 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 21:00:23,623 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:23,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:00:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-02 21:00:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-11-02 21:00:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 states have internal predecessors, (260), 0 states have call successors, (0), 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 21:00:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2022-11-02 21:00:23,718 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2022-11-02 21:00:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:23,719 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2022-11-02 21:00:23,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 21:00:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2022-11-02 21:00:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 21:00:23,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:23,726 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 21:00:23,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:00:23,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:23,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591930, now seen corresponding path program 1 times [2022-11-02 21:00:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:23,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432452733] [2022-11-02 21:00:23,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:24,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432452733] [2022-11-02 21:00:24,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432452733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:24,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:24,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22767212] [2022-11-02 21:00:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:24,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:24,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:24,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:24,254 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 21:00:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:25,420 INFO L93 Difference]: Finished difference Result 348 states and 547 transitions. [2022-11-02 21:00:25,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:25,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-02 21:00:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:25,423 INFO L225 Difference]: With dead ends: 348 [2022-11-02 21:00:25,423 INFO L226 Difference]: Without dead ends: 193 [2022-11-02 21:00:25,424 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 21:00:25,425 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:25,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 21:00:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-02 21:00:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2022-11-02 21:00:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.5942857142857143) internal successors, (279), 175 states have internal predecessors, (279), 0 states have call successors, (0), 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 21:00:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 279 transitions. [2022-11-02 21:00:25,440 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 279 transitions. Word has length 38 [2022-11-02 21:00:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:25,441 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 279 transitions. [2022-11-02 21:00:25,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 21:00:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 279 transitions. [2022-11-02 21:00:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 21:00:25,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:25,443 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:00:25,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:00:25,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash 103815440, now seen corresponding path program 1 times [2022-11-02 21:00:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:25,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345852001] [2022-11-02 21:00:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:26,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345852001] [2022-11-02 21:00:26,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345852001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:26,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:26,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758098186] [2022-11-02 21:00:26,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:26,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:26,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:26,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:26,024 INFO L87 Difference]: Start difference. First operand 176 states and 279 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 21:00:27,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:27,670 INFO L93 Difference]: Finished difference Result 478 states and 761 transitions. [2022-11-02 21:00:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-02 21:00:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:27,674 INFO L225 Difference]: With dead ends: 478 [2022-11-02 21:00:27,674 INFO L226 Difference]: Without dead ends: 323 [2022-11-02 21:00:27,675 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 21:00:27,676 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 147 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:27,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 620 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 21:00:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-02 21:00:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 208. [2022-11-02 21:00:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5942028985507246) internal successors, (330), 207 states have internal predecessors, (330), 0 states have call successors, (0), 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 21:00:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 330 transitions. [2022-11-02 21:00:27,692 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 330 transitions. Word has length 51 [2022-11-02 21:00:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:27,692 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 330 transitions. [2022-11-02 21:00:27,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 21:00:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 330 transitions. [2022-11-02 21:00:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:00:27,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:27,694 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:00:27,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:00:27,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1022264289, now seen corresponding path program 1 times [2022-11-02 21:00:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023205136] [2022-11-02 21:00:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:28,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023205136] [2022-11-02 21:00:28,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023205136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:28,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:28,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576434674] [2022-11-02 21:00:28,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:28,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:28,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:28,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:28,167 INFO L87 Difference]: Start difference. First operand 208 states and 330 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 21:00:30,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:30,813 INFO L93 Difference]: Finished difference Result 497 states and 786 transitions. [2022-11-02 21:00:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:30,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-02 21:00:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:30,816 INFO L225 Difference]: With dead ends: 497 [2022-11-02 21:00:30,816 INFO L226 Difference]: Without dead ends: 310 [2022-11-02 21:00:30,817 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 21:00:30,819 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:30,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:00:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-02 21:00:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 208. [2022-11-02 21:00:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 207 states have internal predecessors, (326), 0 states have call successors, (0), 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 21:00:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 326 transitions. [2022-11-02 21:00:30,833 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 326 transitions. Word has length 52 [2022-11-02 21:00:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:30,834 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 326 transitions. [2022-11-02 21:00:30,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 21:00:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 326 transitions. [2022-11-02 21:00:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:00:30,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:30,836 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:00:30,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:00:30,837 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:30,838 INFO L85 PathProgramCache]: Analyzing trace with hash 40885771, now seen corresponding path program 1 times [2022-11-02 21:00:30,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:30,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712297446] [2022-11-02 21:00:30,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:31,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:31,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712297446] [2022-11-02 21:00:31,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712297446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:31,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:31,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:31,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55126588] [2022-11-02 21:00:31,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:31,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:31,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:31,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:31,247 INFO L87 Difference]: Start difference. First operand 208 states and 326 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 21:00:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:32,129 INFO L93 Difference]: Finished difference Result 411 states and 641 transitions. [2022-11-02 21:00:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-02 21:00:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:32,131 INFO L225 Difference]: With dead ends: 411 [2022-11-02 21:00:32,131 INFO L226 Difference]: Without dead ends: 224 [2022-11-02 21:00:32,131 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 21:00:32,132 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 26 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:32,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:00:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-02 21:00:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2022-11-02 21:00:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.570048309178744) internal successors, (325), 207 states have internal predecessors, (325), 0 states have call successors, (0), 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 21:00:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 325 transitions. [2022-11-02 21:00:32,142 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 325 transitions. Word has length 52 [2022-11-02 21:00:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:32,142 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 325 transitions. [2022-11-02 21:00:32,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 21:00:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 325 transitions. [2022-11-02 21:00:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:00:32,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:32,155 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:00:32,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:00:32,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 861050644, now seen corresponding path program 1 times [2022-11-02 21:00:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:32,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127922903] [2022-11-02 21:00:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:32,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:32,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:32,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127922903] [2022-11-02 21:00:32,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127922903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:32,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:32,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:32,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277582058] [2022-11-02 21:00:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:32,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:32,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:32,522 INFO L87 Difference]: Start difference. First operand 208 states and 325 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 21:00:34,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:34,904 INFO L93 Difference]: Finished difference Result 410 states and 639 transitions. [2022-11-02 21:00:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:34,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-02 21:00:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:34,906 INFO L225 Difference]: With dead ends: 410 [2022-11-02 21:00:34,906 INFO L226 Difference]: Without dead ends: 223 [2022-11-02 21:00:34,906 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 21:00:34,907 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 19 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:34,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 475 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:00:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-02 21:00:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2022-11-02 21:00:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.565217391304348) internal successors, (324), 207 states have internal predecessors, (324), 0 states have call successors, (0), 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 21:00:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 324 transitions. [2022-11-02 21:00:34,915 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 324 transitions. Word has length 52 [2022-11-02 21:00:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:34,915 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 324 transitions. [2022-11-02 21:00:34,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 21:00:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 324 transitions. [2022-11-02 21:00:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:00:34,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:34,920 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:00:34,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:00:34,921 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:34,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1296410196, now seen corresponding path program 1 times [2022-11-02 21:00:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:34,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583260938] [2022-11-02 21:00:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:35,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:35,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583260938] [2022-11-02 21:00:35,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583260938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:35,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:35,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:35,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394930336] [2022-11-02 21:00:35,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:35,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:35,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:35,245 INFO L87 Difference]: Start difference. First operand 208 states and 324 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 21:00:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:36,651 INFO L93 Difference]: Finished difference Result 497 states and 777 transitions. [2022-11-02 21:00:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-02 21:00:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:36,653 INFO L225 Difference]: With dead ends: 497 [2022-11-02 21:00:36,653 INFO L226 Difference]: Without dead ends: 310 [2022-11-02 21:00:36,654 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 21:00:36,655 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 145 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:36,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 21:00:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-02 21:00:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-11-02 21:00:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5528846153846154) internal successors, (323), 208 states have internal predecessors, (323), 0 states have call successors, (0), 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 21:00:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2022-11-02 21:00:36,667 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 52 [2022-11-02 21:00:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:36,668 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2022-11-02 21:00:36,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 21:00:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2022-11-02 21:00:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 21:00:36,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:36,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:36,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:00:36,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:36,671 INFO L85 PathProgramCache]: Analyzing trace with hash 585554567, now seen corresponding path program 1 times [2022-11-02 21:00:36,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:36,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282220922] [2022-11-02 21:00:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:37,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282220922] [2022-11-02 21:00:37,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282220922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:37,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:37,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67272128] [2022-11-02 21:00:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:37,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:37,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:37,068 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:38,269 INFO L93 Difference]: Finished difference Result 410 states and 635 transitions. [2022-11-02 21:00:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-02 21:00:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:38,277 INFO L225 Difference]: With dead ends: 410 [2022-11-02 21:00:38,277 INFO L226 Difference]: Without dead ends: 222 [2022-11-02 21:00:38,277 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 21:00:38,278 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 22 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:38,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 21:00:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-02 21:00:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2022-11-02 21:00:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 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 21:00:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2022-11-02 21:00:38,289 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 53 [2022-11-02 21:00:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:38,289 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2022-11-02 21:00:38,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2022-11-02 21:00:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 21:00:38,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:38,291 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:00:38,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:00:38,292 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash -991616538, now seen corresponding path program 1 times [2022-11-02 21:00:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242959196] [2022-11-02 21:00:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:38,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242959196] [2022-11-02 21:00:38,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242959196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:38,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:38,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538316946] [2022-11-02 21:00:38,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:38,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:38,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:38,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:38,748 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:39,698 INFO L93 Difference]: Finished difference Result 498 states and 773 transitions. [2022-11-02 21:00:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-02 21:00:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:39,700 INFO L225 Difference]: With dead ends: 498 [2022-11-02 21:00:39,700 INFO L226 Difference]: Without dead ends: 310 [2022-11-02 21:00:39,701 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 21:00:39,702 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:39,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:00:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-02 21:00:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-11-02 21:00:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 208 states have internal predecessors, (318), 0 states have call successors, (0), 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 21:00:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 318 transitions. [2022-11-02 21:00:39,713 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 318 transitions. Word has length 54 [2022-11-02 21:00:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:39,714 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 318 transitions. [2022-11-02 21:00:39,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 318 transitions. [2022-11-02 21:00:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:00:39,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:39,715 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:00:39,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:00:39,716 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash 373652162, now seen corresponding path program 1 times [2022-11-02 21:00:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:39,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591509403] [2022-11-02 21:00:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:39,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:40,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591509403] [2022-11-02 21:00:40,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591509403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:40,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:40,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:40,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509091803] [2022-11-02 21:00:40,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:40,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:40,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:40,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:40,067 INFO L87 Difference]: Start difference. First operand 209 states and 318 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 21:00:41,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:41,925 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-11-02 21:00:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:41,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-02 21:00:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:41,926 INFO L225 Difference]: With dead ends: 400 [2022-11-02 21:00:41,926 INFO L226 Difference]: Without dead ends: 212 [2022-11-02 21:00:41,927 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 21:00:41,928 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:41,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 493 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 21:00:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-02 21:00:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2022-11-02 21:00:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 208 states have internal predecessors, (317), 0 states have call successors, (0), 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 21:00:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 317 transitions. [2022-11-02 21:00:41,935 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 317 transitions. Word has length 55 [2022-11-02 21:00:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:41,936 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 317 transitions. [2022-11-02 21:00:41,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 21:00:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 317 transitions. [2022-11-02 21:00:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:00:41,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:41,937 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:00:41,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:00:41,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1312076378, now seen corresponding path program 1 times [2022-11-02 21:00:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:41,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279533373] [2022-11-02 21:00:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:42,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279533373] [2022-11-02 21:00:42,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279533373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:42,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:42,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919262836] [2022-11-02 21:00:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:42,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:42,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:42,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:42,191 INFO L87 Difference]: Start difference. First operand 209 states and 317 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 21:00:43,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:43,698 INFO L93 Difference]: Finished difference Result 437 states and 668 transitions. [2022-11-02 21:00:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:43,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-02 21:00:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:43,700 INFO L225 Difference]: With dead ends: 437 [2022-11-02 21:00:43,700 INFO L226 Difference]: Without dead ends: 249 [2022-11-02 21:00:43,701 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 21:00:43,701 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:43,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 21:00:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-02 21:00:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2022-11-02 21:00:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5260869565217392) internal successors, (351), 230 states have internal predecessors, (351), 0 states have call successors, (0), 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 21:00:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 351 transitions. [2022-11-02 21:00:43,710 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 351 transitions. Word has length 55 [2022-11-02 21:00:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:43,710 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 351 transitions. [2022-11-02 21:00:43,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 21:00:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 351 transitions. [2022-11-02 21:00:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 21:00:43,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:43,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-02 21:00:43,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:00:43,712 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1411411051, now seen corresponding path program 1 times [2022-11-02 21:00:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:43,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667524415] [2022-11-02 21:00:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:44,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:44,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667524415] [2022-11-02 21:00:44,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667524415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:44,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:44,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285821306] [2022-11-02 21:00:44,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:44,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:44,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:44,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:44,029 INFO L87 Difference]: Start difference. First operand 231 states and 351 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:45,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:45,742 INFO L93 Difference]: Finished difference Result 542 states and 833 transitions. [2022-11-02 21:00:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:45,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-02 21:00:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:45,744 INFO L225 Difference]: With dead ends: 542 [2022-11-02 21:00:45,744 INFO L226 Difference]: Without dead ends: 332 [2022-11-02 21:00:45,745 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 21:00:45,745 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 149 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:45,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 21:00:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-02 21:00:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2022-11-02 21:00:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 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 21:00:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2022-11-02 21:00:45,754 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 69 [2022-11-02 21:00:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:45,755 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2022-11-02 21:00:45,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2022-11-02 21:00:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 21:00:45,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:45,759 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:00:45,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:00:45,760 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:45,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2063391372, now seen corresponding path program 1 times [2022-11-02 21:00:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:45,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284516354] [2022-11-02 21:00:45,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:45,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:46,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284516354] [2022-11-02 21:00:46,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284516354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:46,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:46,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:46,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562042010] [2022-11-02 21:00:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:46,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:46,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:46,075 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:48,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:48,604 INFO L93 Difference]: Finished difference Result 541 states and 824 transitions. [2022-11-02 21:00:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-02 21:00:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:48,607 INFO L225 Difference]: With dead ends: 541 [2022-11-02 21:00:48,607 INFO L226 Difference]: Without dead ends: 331 [2022-11-02 21:00:48,607 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 21:00:48,608 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 142 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:48,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:00:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-02 21:00:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-11-02 21:00:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4978354978354977) internal successors, (346), 231 states have internal predecessors, (346), 0 states have call successors, (0), 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 21:00:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 346 transitions. [2022-11-02 21:00:48,618 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 346 transitions. Word has length 69 [2022-11-02 21:00:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:48,618 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 346 transitions. [2022-11-02 21:00:48,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 346 transitions. [2022-11-02 21:00:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 21:00:48,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:48,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-02 21:00:48,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:00:48,620 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 122165287, now seen corresponding path program 1 times [2022-11-02 21:00:48,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:48,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048371721] [2022-11-02 21:00:48,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:48,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:48,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048371721] [2022-11-02 21:00:48,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048371721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:48,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:48,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754407705] [2022-11-02 21:00:48,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:48,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:48,935 INFO L87 Difference]: Start difference. First operand 232 states and 346 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 21:00:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:50,100 INFO L93 Difference]: Finished difference Result 542 states and 820 transitions. [2022-11-02 21:00:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-11-02 21:00:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:50,102 INFO L225 Difference]: With dead ends: 542 [2022-11-02 21:00:50,102 INFO L226 Difference]: Without dead ends: 331 [2022-11-02 21:00:50,103 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 21:00:50,103 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 146 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:50,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 21:00:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-02 21:00:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-11-02 21:00:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4805194805194806) internal successors, (342), 231 states have internal predecessors, (342), 0 states have call successors, (0), 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 21:00:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2022-11-02 21:00:50,113 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 70 [2022-11-02 21:00:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:50,113 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2022-11-02 21:00:50,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 21:00:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2022-11-02 21:00:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 21:00:50,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:50,115 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:00:50,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:00:50,115 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1733152866, now seen corresponding path program 1 times [2022-11-02 21:00:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:50,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581455625] [2022-11-02 21:00:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:50,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581455625] [2022-11-02 21:00:50,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581455625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:50,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:50,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:50,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176370529] [2022-11-02 21:00:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:50,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:50,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:50,404 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:52,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:52,678 INFO L93 Difference]: Finished difference Result 450 states and 669 transitions. [2022-11-02 21:00:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-02 21:00:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:52,680 INFO L225 Difference]: With dead ends: 450 [2022-11-02 21:00:52,680 INFO L226 Difference]: Without dead ends: 239 [2022-11-02 21:00:52,681 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 21:00:52,681 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 26 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:52,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 513 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:00:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-02 21:00:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2022-11-02 21:00:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4761904761904763) internal successors, (341), 231 states have internal predecessors, (341), 0 states have call successors, (0), 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 21:00:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2022-11-02 21:00:52,691 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 72 [2022-11-02 21:00:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:52,691 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2022-11-02 21:00:52,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2022-11-02 21:00:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 21:00:52,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:52,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:00:52,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:00:52,693 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:52,693 INFO L85 PathProgramCache]: Analyzing trace with hash 293504549, now seen corresponding path program 1 times [2022-11-02 21:00:52,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:52,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146533458] [2022-11-02 21:00:52,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:52,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:00:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:53,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146533458] [2022-11-02 21:00:53,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146533458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:53,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:53,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548303812] [2022-11-02 21:00:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:53,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:53,059 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:00:55,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:55,489 INFO L93 Difference]: Finished difference Result 538 states and 797 transitions. [2022-11-02 21:00:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:55,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-11-02 21:00:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:55,492 INFO L225 Difference]: With dead ends: 538 [2022-11-02 21:00:55,492 INFO L226 Difference]: Without dead ends: 327 [2022-11-02 21:00:55,492 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 21:00:55,493 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 88 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:55,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 471 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 242 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:00:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-02 21:00:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 263. [2022-11-02 21:00:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4770992366412214) internal successors, (387), 262 states have internal predecessors, (387), 0 states have call successors, (0), 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 21:00:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-11-02 21:00:55,504 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 77 [2022-11-02 21:00:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:55,504 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-11-02 21:00:55,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:00:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-11-02 21:00:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 21:00:55,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:55,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:00:55,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:00:55,506 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1950478749, now seen corresponding path program 1 times [2022-11-02 21:00:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:55,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890668251] [2022-11-02 21:00:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:00:55,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:55,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890668251] [2022-11-02 21:00:55,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890668251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:55,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:55,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197464094] [2022-11-02 21:00:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:55,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:55,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:55,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:55,869 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:00:57,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:00:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:57,527 INFO L93 Difference]: Finished difference Result 551 states and 815 transitions. [2022-11-02 21:00:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:57,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-11-02 21:00:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:57,530 INFO L225 Difference]: With dead ends: 551 [2022-11-02 21:00:57,530 INFO L226 Difference]: Without dead ends: 309 [2022-11-02 21:00:57,530 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 21:00:57,531 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 35 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:57,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 589 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 21:00:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-02 21:00:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 287. [2022-11-02 21:00:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.4755244755244756) internal successors, (422), 286 states have internal predecessors, (422), 0 states have call successors, (0), 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 21:00:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 422 transitions. [2022-11-02 21:00:57,541 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 422 transitions. Word has length 77 [2022-11-02 21:00:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:57,542 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 422 transitions. [2022-11-02 21:00:57,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:00:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 422 transitions. [2022-11-02 21:00:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 21:00:57,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:57,543 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:00:57,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:00:57,544 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:57,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2009733770, now seen corresponding path program 1 times [2022-11-02 21:00:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:57,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164647662] [2022-11-02 21:00:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:00:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:57,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164647662] [2022-11-02 21:00:57,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164647662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:57,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:57,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:57,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364891601] [2022-11-02 21:00:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:57,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:57,903 INFO L87 Difference]: Start difference. First operand 287 states and 422 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:59,131 INFO L93 Difference]: Finished difference Result 617 states and 912 transitions. [2022-11-02 21:00:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:59,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-11-02 21:00:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:59,133 INFO L225 Difference]: With dead ends: 617 [2022-11-02 21:00:59,133 INFO L226 Difference]: Without dead ends: 351 [2022-11-02 21:00:59,134 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 21:00:59,135 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 77 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:59,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 469 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 21:00:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-02 21:00:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 297. [2022-11-02 21:00:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.489864864864865) internal successors, (441), 296 states have internal predecessors, (441), 0 states have call successors, (0), 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 21:00:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2022-11-02 21:00:59,145 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 82 [2022-11-02 21:00:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:59,146 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2022-11-02 21:00:59,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2022-11-02 21:00:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 21:00:59,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:59,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:00:59,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:00:59,148 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2129799745, now seen corresponding path program 1 times [2022-11-02 21:00:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:59,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681805946] [2022-11-02 21:00:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:00:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:59,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681805946] [2022-11-02 21:00:59,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681805946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:59,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:59,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:59,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059599002] [2022-11-02 21:00:59,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:59,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:59,514 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:01,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:01:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:01,552 INFO L93 Difference]: Finished difference Result 621 states and 923 transitions. [2022-11-02 21:01:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:01:01,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-02 21:01:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:01,554 INFO L225 Difference]: With dead ends: 621 [2022-11-02 21:01:01,554 INFO L226 Difference]: Without dead ends: 345 [2022-11-02 21:01:01,555 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 21:01:01,556 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 70 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:01,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 475 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 21:01:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-02 21:01:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2022-11-02 21:01:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4882154882154883) internal successors, (442), 297 states have internal predecessors, (442), 0 states have call successors, (0), 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 21:01:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions. [2022-11-02 21:01:01,566 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 83 [2022-11-02 21:01:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:01,567 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions. [2022-11-02 21:01:01,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2022-11-02 21:01:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 21:01:01,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:01,569 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:01,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:01:01,569 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1674400777, now seen corresponding path program 1 times [2022-11-02 21:01:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:01,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820242787] [2022-11-02 21:01:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 21:01:02,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:02,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820242787] [2022-11-02 21:01:02,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820242787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:02,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:02,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:01:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312048777] [2022-11-02 21:01:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:02,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:02,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:02,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:02,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:02,031 INFO L87 Difference]: Start difference. First operand 298 states and 442 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 21:01:03,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:01:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:04,329 INFO L93 Difference]: Finished difference Result 585 states and 872 transitions. [2022-11-02 21:01:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:01:04,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-11-02 21:01:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:04,331 INFO L225 Difference]: With dead ends: 585 [2022-11-02 21:01:04,331 INFO L226 Difference]: Without dead ends: 308 [2022-11-02 21:01:04,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 21:01:04,332 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 149 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:04,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 354 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:01:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-02 21:01:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2022-11-02 21:01:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4803921568627452) internal successors, (453), 306 states have internal predecessors, (453), 0 states have call successors, (0), 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 21:01:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 453 transitions. [2022-11-02 21:01:04,342 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 453 transitions. Word has length 94 [2022-11-02 21:01:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:04,342 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 453 transitions. [2022-11-02 21:01:04,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 21:01:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 453 transitions. [2022-11-02 21:01:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 21:01:04,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:04,344 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:04,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:01:04,344 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1278038072, now seen corresponding path program 1 times [2022-11-02 21:01:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:04,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593681866] [2022-11-02 21:01:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:01:04,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:04,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593681866] [2022-11-02 21:01:04,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593681866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:04,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:04,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:04,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493651149] [2022-11-02 21:01:04,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:04,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:01:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:01:04,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:01:04,769 INFO L87 Difference]: Start difference. First operand 307 states and 453 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 21:01:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:06,197 INFO L93 Difference]: Finished difference Result 682 states and 1021 transitions. [2022-11-02 21:01:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:01:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-11-02 21:01:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:06,199 INFO L225 Difference]: With dead ends: 682 [2022-11-02 21:01:06,200 INFO L226 Difference]: Without dead ends: 396 [2022-11-02 21:01:06,200 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 21:01:06,201 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 136 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:06,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 354 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 21:01:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-02 21:01:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 307. [2022-11-02 21:01:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4640522875816993) internal successors, (448), 306 states have internal predecessors, (448), 0 states have call successors, (0), 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 21:01:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 448 transitions. [2022-11-02 21:01:06,221 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 448 transitions. Word has length 95 [2022-11-02 21:01:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:06,222 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 448 transitions. [2022-11-02 21:01:06,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 21:01:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 448 transitions. [2022-11-02 21:01:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 21:01:06,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:06,224 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:06,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:01:06,224 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:06,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash 868200130, now seen corresponding path program 1 times [2022-11-02 21:01:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:06,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930059113] [2022-11-02 21:01:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:01:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:06,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930059113] [2022-11-02 21:01:06,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930059113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:06,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:06,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672047788] [2022-11-02 21:01:06,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:06,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:01:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:06,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:01:06,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:01:06,598 INFO L87 Difference]: Start difference. First operand 307 states and 448 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 21:01:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:07,709 INFO L93 Difference]: Finished difference Result 630 states and 922 transitions. [2022-11-02 21:01:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:01:07,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-02 21:01:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:07,711 INFO L225 Difference]: With dead ends: 630 [2022-11-02 21:01:07,711 INFO L226 Difference]: Without dead ends: 344 [2022-11-02 21:01:07,712 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 21:01:07,712 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 77 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:07,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 503 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 21:01:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-02 21:01:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 307. [2022-11-02 21:01:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 306 states have internal predecessors, (447), 0 states have call successors, (0), 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 21:01:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 447 transitions. [2022-11-02 21:01:07,725 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 447 transitions. Word has length 99 [2022-11-02 21:01:07,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:07,726 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 447 transitions. [2022-11-02 21:01:07,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 21:01:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 447 transitions. [2022-11-02 21:01:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 21:01:07,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:07,727 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:07,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:01:07,728 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash 908874880, now seen corresponding path program 1 times [2022-11-02 21:01:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:07,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462064714] [2022-11-02 21:01:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 21:01:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:07,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462064714] [2022-11-02 21:01:07,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462064714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:07,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:07,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752605064] [2022-11-02 21:01:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:07,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:07,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:07,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:07,885 INFO L87 Difference]: Start difference. First operand 307 states and 447 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 21:01:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:07,975 INFO L93 Difference]: Finished difference Result 874 states and 1287 transitions. [2022-11-02 21:01:07,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:07,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-02 21:01:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:07,977 INFO L225 Difference]: With dead ends: 874 [2022-11-02 21:01:07,978 INFO L226 Difference]: Without dead ends: 588 [2022-11-02 21:01:07,978 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 21:01:07,979 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:07,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-11-02 21:01:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2022-11-02 21:01:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.4565587734241907) internal successors, (855), 587 states have internal predecessors, (855), 0 states have call successors, (0), 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 21:01:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 855 transitions. [2022-11-02 21:01:08,000 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 855 transitions. Word has length 99 [2022-11-02 21:01:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:08,001 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 855 transitions. [2022-11-02 21:01:08,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 21:01:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 855 transitions. [2022-11-02 21:01:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 21:01:08,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:08,003 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:08,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:01:08,003 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1342603966, now seen corresponding path program 1 times [2022-11-02 21:01:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:08,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412767027] [2022-11-02 21:01:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:08,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 21:01:08,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:08,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412767027] [2022-11-02 21:01:08,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412767027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:08,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:08,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563244679] [2022-11-02 21:01:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:08,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:08,124 INFO L87 Difference]: Start difference. First operand 588 states and 855 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 21:01:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:08,167 INFO L93 Difference]: Finished difference Result 1182 states and 1722 transitions. [2022-11-02 21:01:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:08,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-02 21:01:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:08,169 INFO L225 Difference]: With dead ends: 1182 [2022-11-02 21:01:08,170 INFO L226 Difference]: Without dead ends: 615 [2022-11-02 21:01:08,171 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 21:01:08,171 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:08,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-11-02 21:01:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-11-02 21:01:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4495114006514658) internal successors, (890), 614 states have internal predecessors, (890), 0 states have call successors, (0), 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 21:01:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 890 transitions. [2022-11-02 21:01:08,194 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 890 transitions. Word has length 99 [2022-11-02 21:01:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:08,194 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 890 transitions. [2022-11-02 21:01:08,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 21:01:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 890 transitions. [2022-11-02 21:01:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 21:01:08,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:08,196 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:08,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:01:08,197 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:08,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2113329668, now seen corresponding path program 1 times [2022-11-02 21:01:08,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:08,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139494280] [2022-11-02 21:01:08,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:08,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-02 21:01:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:08,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139494280] [2022-11-02 21:01:08,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139494280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:08,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:08,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953569131] [2022-11-02 21:01:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:08,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:08,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:08,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:08,311 INFO L87 Difference]: Start difference. First operand 615 states and 890 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:08,348 INFO L93 Difference]: Finished difference Result 1211 states and 1758 transitions. [2022-11-02 21:01:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:08,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-02 21:01:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:08,350 INFO L225 Difference]: With dead ends: 1211 [2022-11-02 21:01:08,351 INFO L226 Difference]: Without dead ends: 617 [2022-11-02 21:01:08,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:08,352 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:08,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-02 21:01:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2022-11-02 21:01:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.448051948051948) internal successors, (892), 616 states have internal predecessors, (892), 0 states have call successors, (0), 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 21:01:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 892 transitions. [2022-11-02 21:01:08,375 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 892 transitions. Word has length 99 [2022-11-02 21:01:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:08,375 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 892 transitions. [2022-11-02 21:01:08,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 892 transitions. [2022-11-02 21:01:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:01:08,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:08,377 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:08,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:01:08,377 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:08,378 INFO L85 PathProgramCache]: Analyzing trace with hash -254845290, now seen corresponding path program 1 times [2022-11-02 21:01:08,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:08,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753292724] [2022-11-02 21:01:08,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:08,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 21:01:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:08,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753292724] [2022-11-02 21:01:08,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753292724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:08,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:08,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880017251] [2022-11-02 21:01:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:08,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:08,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:08,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:08,569 INFO L87 Difference]: Start difference. First operand 617 states and 892 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 21:01:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:08,639 INFO L93 Difference]: Finished difference Result 1497 states and 2179 transitions. [2022-11-02 21:01:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-11-02 21:01:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:08,643 INFO L225 Difference]: With dead ends: 1497 [2022-11-02 21:01:08,643 INFO L226 Difference]: Without dead ends: 903 [2022-11-02 21:01:08,646 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 21:01:08,646 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 164 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:08,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 372 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-11-02 21:01:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 901. [2022-11-02 21:01:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.4566666666666668) internal successors, (1311), 900 states have internal predecessors, (1311), 0 states have call successors, (0), 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 21:01:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1311 transitions. [2022-11-02 21:01:08,683 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1311 transitions. Word has length 101 [2022-11-02 21:01:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:08,683 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1311 transitions. [2022-11-02 21:01:08,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 21:01:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1311 transitions. [2022-11-02 21:01:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 21:01:08,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:08,685 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:08,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:01:08,686 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:08,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash 34857145, now seen corresponding path program 1 times [2022-11-02 21:01:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:08,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267306943] [2022-11-02 21:01:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 21:01:08,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:08,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267306943] [2022-11-02 21:01:08,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267306943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:08,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:08,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037880922] [2022-11-02 21:01:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:08,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:08,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:08,840 INFO L87 Difference]: Start difference. First operand 901 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 21:01:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:08,920 INFO L93 Difference]: Finished difference Result 2065 states and 3015 transitions. [2022-11-02 21:01:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:08,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-11-02 21:01:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:08,925 INFO L225 Difference]: With dead ends: 2065 [2022-11-02 21:01:08,925 INFO L226 Difference]: Without dead ends: 1187 [2022-11-02 21:01:08,926 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 21:01:08,928 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:08,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-11-02 21:01:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1185. [2022-11-02 21:01:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4493243243243243) internal successors, (1716), 1184 states have internal predecessors, (1716), 0 states have call successors, (0), 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 21:01:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1716 transitions. [2022-11-02 21:01:08,974 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1716 transitions. Word has length 106 [2022-11-02 21:01:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:08,975 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 1716 transitions. [2022-11-02 21:01:08,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 21:01:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1716 transitions. [2022-11-02 21:01:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-02 21:01:08,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:08,977 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-11-02 21:01:08,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:01:08,978 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -285519407, now seen corresponding path program 1 times [2022-11-02 21:01:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:08,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224395773] [2022-11-02 21:01:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 21:01:09,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:09,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224395773] [2022-11-02 21:01:09,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224395773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:09,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:09,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179748073] [2022-11-02 21:01:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:09,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:09,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:09,169 INFO L87 Difference]: Start difference. First operand 1185 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 21:01:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:09,249 INFO L93 Difference]: Finished difference Result 2626 states and 3817 transitions. [2022-11-02 21:01:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:09,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-11-02 21:01:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:09,255 INFO L225 Difference]: With dead ends: 2626 [2022-11-02 21:01:09,255 INFO L226 Difference]: Without dead ends: 1464 [2022-11-02 21:01:09,256 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 21:01:09,257 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:09,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-11-02 21:01:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2022-11-02 21:01:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.4497607655502391) internal successors, (2121), 1463 states have internal predecessors, (2121), 0 states have call successors, (0), 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 21:01:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2121 transitions. [2022-11-02 21:01:09,310 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2121 transitions. Word has length 123 [2022-11-02 21:01:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:09,310 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 2121 transitions. [2022-11-02 21:01:09,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 21:01:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2121 transitions. [2022-11-02 21:01:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-02 21:01:09,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:09,313 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-11-02 21:01:09,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 21:01:09,313 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1271906027, now seen corresponding path program 1 times [2022-11-02 21:01:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:09,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93334497] [2022-11-02 21:01:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-02 21:01:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:09,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93334497] [2022-11-02 21:01:09,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93334497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:09,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:09,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227287376] [2022-11-02 21:01:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:09,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:09,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:09,506 INFO L87 Difference]: Start difference. First operand 1464 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 21:01:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:09,620 INFO L93 Difference]: Finished difference Result 1752 states and 2537 transitions. [2022-11-02 21:01:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-11-02 21:01:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:09,626 INFO L225 Difference]: With dead ends: 1752 [2022-11-02 21:01:09,626 INFO L226 Difference]: Without dead ends: 1750 [2022-11-02 21:01:09,627 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 21:01:09,631 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 165 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:09,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 371 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-11-02 21:01:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1748. [2022-11-02 21:01:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.450486548368632) internal successors, (2534), 1747 states have internal predecessors, (2534), 0 states have call successors, (0), 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 21:01:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2534 transitions. [2022-11-02 21:01:09,714 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2534 transitions. Word has length 129 [2022-11-02 21:01:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:09,714 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2534 transitions. [2022-11-02 21:01:09,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 21:01:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2534 transitions. [2022-11-02 21:01:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-02 21:01:09,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:09,719 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:09,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 21:01:09,719 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1650407178, now seen corresponding path program 1 times [2022-11-02 21:01:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:09,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813371638] [2022-11-02 21:01:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-11-02 21:01:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:11,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813371638] [2022-11-02 21:01:11,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813371638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:11,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:11,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:01:11,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719539850] [2022-11-02 21:01:11,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:11,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:11,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:11,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:11,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:11,877 INFO L87 Difference]: Start difference. First operand 1748 states and 2534 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:13,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:01:14,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:01:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:15,055 INFO L93 Difference]: Finished difference Result 3493 states and 5064 transitions. [2022-11-02 21:01:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:01:15,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2022-11-02 21:01:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:15,062 INFO L225 Difference]: With dead ends: 3493 [2022-11-02 21:01:15,062 INFO L226 Difference]: Without dead ends: 1748 [2022-11-02 21:01:15,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 21:01:15,065 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:15,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-02 21:01:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-11-02 21:01:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748. [2022-11-02 21:01:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.4499141385231826) internal successors, (2533), 1747 states have internal predecessors, (2533), 0 states have call successors, (0), 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 21:01:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2533 transitions. [2022-11-02 21:01:15,141 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2533 transitions. Word has length 166 [2022-11-02 21:01:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:15,141 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2533 transitions. [2022-11-02 21:01:15,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2533 transitions. [2022-11-02 21:01:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-02 21:01:15,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:15,148 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:01:15,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 21:01:15,148 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash -74201144, now seen corresponding path program 1 times [2022-11-02 21:01:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:15,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813955819] [2022-11-02 21:01:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 21:01:30,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:30,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813955819] [2022-11-02 21:01:30,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813955819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:30,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130862720] [2022-11-02 21:01:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:30,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:30,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:30,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:30,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e72f084-a8ff-46f7-9e73-1bccd7e9c16c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:01:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 239 conjunts are in the unsatisfiable core [2022-11-02 21:01:31,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:32,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:01:32,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28153 treesize of output 23896 [2022-11-02 21:01:32,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:01:32,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:01:32,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:01:32,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10709 treesize of output 1662