./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/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_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/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_b054a958-613e-42bd-98be-ede495286621/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 ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:44:06,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:44:06,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:44:06,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:44:06,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:44:06,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:44:06,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:44:06,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:44:06,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:44:06,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:44:06,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:44:06,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:44:06,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:44:06,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:44:06,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:44:06,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:44:06,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:44:06,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:44:06,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:44:06,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:44:06,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:44:06,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:44:06,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:44:06,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:44:06,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:44:06,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:44:06,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:44:06,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:44:06,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:44:06,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:44:06,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:44:06,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:44:06,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:44:06,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:44:06,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:44:06,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:44:06,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:44:06,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:44:06,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:44:06,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:44:06,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:44:06,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:44:07,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:44:07,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:44:07,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:44:07,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:44:07,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:44:07,009 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:44:07,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:44:07,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:44:07,010 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:44:07,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:44:07,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:44:07,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:44:07,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:44:07,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:44:07,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:44:07,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:44:07,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:44:07,014 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:44:07,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:44:07,014 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:44:07,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:44:07,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:44:07,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:44:07,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:44:07,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:44:07,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:44:07,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:44:07,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:44:07,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:44:07,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:44:07,019 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:44:07,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:44:07,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:44:07,020 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_b054a958-613e-42bd-98be-ede495286621/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_b054a958-613e-42bd-98be-ede495286621/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 -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2022-11-02 20:44:07,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:44:07,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:44:07,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:44:07,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:44:07,398 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:44:07,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2022-11-02 20:44:07,466 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/data/599c247cc/1f7068640a36402eb7138a67e6d0caac/FLAGab4318827 [2022-11-02 20:44:08,006 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:44:08,006 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2022-11-02 20:44:08,023 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/data/599c247cc/1f7068640a36402eb7138a67e6d0caac/FLAGab4318827 [2022-11-02 20:44:08,343 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/data/599c247cc/1f7068640a36402eb7138a67e6d0caac [2022-11-02 20:44:08,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:44:08,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:44:08,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:44:08,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:44:08,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:44:08,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129baf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08, skipping insertion in model container [2022-11-02 20:44:08,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:44:08,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:44:08,693 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_b054a958-613e-42bd-98be-ede495286621/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2022-11-02 20:44:08,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:44:08,708 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:44:08,781 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_b054a958-613e-42bd-98be-ede495286621/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2022-11-02 20:44:08,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:44:08,797 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:44:08,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08 WrapperNode [2022-11-02 20:44:08,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:44:08,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:44:08,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:44:08,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:44:08,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,857 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 479 [2022-11-02 20:44:08,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:44:08,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:44:08,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:44:08,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:44:08,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,888 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:44:08,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:44:08,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:44:08,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:44:08,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (1/1) ... [2022-11-02 20:44:08,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:44:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:08,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:44:08,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:44:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:44:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:44:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:44:09,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:44:09,095 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:44:09,097 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:44:09,113 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:44:09,670 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-11-02 20:44:09,670 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-11-02 20:44:09,670 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:44:09,678 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:44:09,702 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:44:09,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:09 BoogieIcfgContainer [2022-11-02 20:44:09,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:44:09,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:44:09,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:44:09,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:44:09,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:44:08" (1/3) ... [2022-11-02 20:44:09,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2437ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:44:09, skipping insertion in model container [2022-11-02 20:44:09,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:08" (2/3) ... [2022-11-02 20:44:09,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2437ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:44:09, skipping insertion in model container [2022-11-02 20:44:09,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:09" (3/3) ... [2022-11-02 20:44:09,724 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2022-11-02 20:44:09,798 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:44:09,798 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:44:09,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:44:09,887 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;@1d8cde76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:44:09,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:44:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:44:09,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:09,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:09,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 259999105, now seen corresponding path program 1 times [2022-11-02 20:44:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:09,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868294537] [2022-11-02 20:44:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:10,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:10,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868294537] [2022-11-02 20:44:10,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868294537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:10,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:10,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357289668] [2022-11-02 20:44:10,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:10,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:10,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:10,249 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:10,472 INFO L93 Difference]: Finished difference Result 247 states and 423 transitions. [2022-11-02 20:44:10,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:44:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:10,489 INFO L225 Difference]: With dead ends: 247 [2022-11-02 20:44:10,490 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:44:10,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:10,499 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:10,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 320 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:44:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:44:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-02 20:44:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 112 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2022-11-02 20:44:10,546 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 25 [2022-11-02 20:44:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:10,546 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2022-11-02 20:44:10,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2022-11-02 20:44:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:44:10,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:10,548 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] [2022-11-02 20:44:10,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:44:10,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1138040513, now seen corresponding path program 1 times [2022-11-02 20:44:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:10,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355282778] [2022-11-02 20:44:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:10,732 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 20:44:10,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:10,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355282778] [2022-11-02 20:44:10,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355282778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:10,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:10,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754102408] [2022-11-02 20:44:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:10,737 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 20:44:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:10,915 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2022-11-02 20:44:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 20:44:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:10,917 INFO L225 Difference]: With dead ends: 233 [2022-11-02 20:44:10,917 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:44:10,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:10,920 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:10,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 241 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:44:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2022-11-02 20:44:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 127 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2022-11-02 20:44:10,933 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 37 [2022-11-02 20:44:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:10,933 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2022-11-02 20:44:10,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 20:44:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2022-11-02 20:44:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:44:10,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:10,935 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:44:10,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:44:10,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:10,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:10,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1126420040, now seen corresponding path program 1 times [2022-11-02 20:44:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:10,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18509071] [2022-11-02 20:44:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:44:11,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:11,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18509071] [2022-11-02 20:44:11,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18509071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:11,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:11,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540844887] [2022-11-02 20:44:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:11,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:11,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:11,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,044 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:11,083 INFO L93 Difference]: Finished difference Result 271 states and 400 transitions. [2022-11-02 20:44:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:11,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 20:44:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:11,087 INFO L225 Difference]: With dead ends: 271 [2022-11-02 20:44:11,087 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 20:44:11,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,089 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 21 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:11,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 20:44:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-02 20:44:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2022-11-02 20:44:11,114 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 51 [2022-11-02 20:44:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:11,115 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2022-11-02 20:44:11,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2022-11-02 20:44:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:44:11,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:11,117 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:44:11,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:44:11,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1260433546, now seen corresponding path program 1 times [2022-11-02 20:44:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:11,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673507567] [2022-11-02 20:44:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:44:11,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:11,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673507567] [2022-11-02 20:44:11,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673507567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:11,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:11,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140997562] [2022-11-02 20:44:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:11,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:11,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:11,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:11,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,238 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:11,375 INFO L93 Difference]: Finished difference Result 292 states and 435 transitions. [2022-11-02 20:44:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:11,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 20:44:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:11,380 INFO L225 Difference]: With dead ends: 292 [2022-11-02 20:44:11,380 INFO L226 Difference]: Without dead ends: 175 [2022-11-02 20:44:11,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,392 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:11,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 254 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-02 20:44:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-11-02 20:44:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4470588235294117) internal successors, (246), 170 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2022-11-02 20:44:11,426 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 51 [2022-11-02 20:44:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:11,427 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2022-11-02 20:44:11,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2022-11-02 20:44:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:44:11,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:11,430 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:44:11,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:44:11,430 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:11,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash -457628469, now seen corresponding path program 1 times [2022-11-02 20:44:11,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:11,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352526343] [2022-11-02 20:44:11,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:44:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:11,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352526343] [2022-11-02 20:44:11,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352526343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:11,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:11,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714799288] [2022-11-02 20:44:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:11,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,589 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:11,622 INFO L93 Difference]: Finished difference Result 436 states and 638 transitions. [2022-11-02 20:44:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:11,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 68 [2022-11-02 20:44:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:11,626 INFO L225 Difference]: With dead ends: 436 [2022-11-02 20:44:11,627 INFO L226 Difference]: Without dead ends: 302 [2022-11-02 20:44:11,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,632 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 124 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:11,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 359 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-02 20:44:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-11-02 20:44:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4451827242524917) internal successors, (435), 301 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 435 transitions. [2022-11-02 20:44:11,658 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 435 transitions. Word has length 68 [2022-11-02 20:44:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:11,658 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 435 transitions. [2022-11-02 20:44:11,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 435 transitions. [2022-11-02 20:44:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 20:44:11,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:11,661 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:44:11,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:44:11,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 562572643, now seen corresponding path program 1 times [2022-11-02 20:44:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:11,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372610513] [2022-11-02 20:44:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:44:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:11,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372610513] [2022-11-02 20:44:11,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372610513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:11,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:11,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233005938] [2022-11-02 20:44:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:11,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:11,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,754 INFO L87 Difference]: Start difference. First operand 302 states and 435 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 20:44:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:11,781 INFO L93 Difference]: Finished difference Result 588 states and 849 transitions. [2022-11-02 20:44:11,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:11,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 69 [2022-11-02 20:44:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:11,784 INFO L225 Difference]: With dead ends: 588 [2022-11-02 20:44:11,785 INFO L226 Difference]: Without dead ends: 323 [2022-11-02 20:44:11,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,787 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:11,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 341 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-02 20:44:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-02 20:44:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.434782608695652) internal successors, (462), 322 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 462 transitions. [2022-11-02 20:44:11,814 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 462 transitions. Word has length 69 [2022-11-02 20:44:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:11,816 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 462 transitions. [2022-11-02 20:44:11,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 20:44:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 462 transitions. [2022-11-02 20:44:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 20:44:11,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:11,822 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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] [2022-11-02 20:44:11,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:44:11,822 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash 777921003, now seen corresponding path program 1 times [2022-11-02 20:44:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:11,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352625786] [2022-11-02 20:44:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-02 20:44:11,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:11,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352625786] [2022-11-02 20:44:11,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352625786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:11,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:11,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:11,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898868217] [2022-11-02 20:44:11,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:11,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:11,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:11,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:11,935 INFO L87 Difference]: Start difference. First operand 323 states and 462 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:12,064 INFO L93 Difference]: Finished difference Result 657 states and 958 transitions. [2022-11-02 20:44:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:12,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 86 [2022-11-02 20:44:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:12,068 INFO L225 Difference]: With dead ends: 657 [2022-11-02 20:44:12,068 INFO L226 Difference]: Without dead ends: 371 [2022-11-02 20:44:12,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:12,072 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:12,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 259 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-02 20:44:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 365. [2022-11-02 20:44:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4120879120879122) internal successors, (514), 364 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 514 transitions. [2022-11-02 20:44:12,090 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 514 transitions. Word has length 86 [2022-11-02 20:44:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:12,092 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 514 transitions. [2022-11-02 20:44:12,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 514 transitions. [2022-11-02 20:44:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:44:12,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:12,100 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2022-11-02 20:44:12,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:44:12,100 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash -97425693, now seen corresponding path program 1 times [2022-11-02 20:44:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:12,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269974651] [2022-11-02 20:44:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-02 20:44:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:12,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269974651] [2022-11-02 20:44:12,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269974651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:12,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:12,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920293631] [2022-11-02 20:44:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:12,269 INFO L87 Difference]: Start difference. First operand 365 states and 514 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 20:44:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:12,309 INFO L93 Difference]: Finished difference Result 520 states and 737 transitions. [2022-11-02 20:44:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:12,310 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 106 [2022-11-02 20:44:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:12,312 INFO L225 Difference]: With dead ends: 520 [2022-11-02 20:44:12,313 INFO L226 Difference]: Without dead ends: 518 [2022-11-02 20:44:12,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:12,314 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 138 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:12,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 301 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-11-02 20:44:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2022-11-02 20:44:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.4216634429400388) internal successors, (735), 517 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 735 transitions. [2022-11-02 20:44:12,336 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 735 transitions. Word has length 106 [2022-11-02 20:44:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:12,337 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 735 transitions. [2022-11-02 20:44:12,338 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 20:44:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 735 transitions. [2022-11-02 20:44:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-02 20:44:12,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:12,346 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2022-11-02 20:44:12,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:44:12,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash -833396868, now seen corresponding path program 1 times [2022-11-02 20:44:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:12,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060235398] [2022-11-02 20:44:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-02 20:44:12,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060235398] [2022-11-02 20:44:12,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060235398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:12,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:12,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757489821] [2022-11-02 20:44:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:12,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:12,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:12,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:12,466 INFO L87 Difference]: Start difference. First operand 518 states and 735 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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 20:44:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:12,640 INFO L93 Difference]: Finished difference Result 1149 states and 1685 transitions. [2022-11-02 20:44:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:12,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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 124 [2022-11-02 20:44:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:12,643 INFO L225 Difference]: With dead ends: 1149 [2022-11-02 20:44:12,644 INFO L226 Difference]: Without dead ends: 665 [2022-11-02 20:44:12,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:12,648 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 75 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:12,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 234 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-02 20:44:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 641. [2022-11-02 20:44:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.4578125) internal successors, (933), 640 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 933 transitions. [2022-11-02 20:44:12,672 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 933 transitions. Word has length 124 [2022-11-02 20:44:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:12,672 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 933 transitions. [2022-11-02 20:44:12,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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 20:44:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 933 transitions. [2022-11-02 20:44:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-02 20:44:12,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:12,676 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 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] [2022-11-02 20:44:12,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:44:12,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1117892099, now seen corresponding path program 1 times [2022-11-02 20:44:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:12,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871502383] [2022-11-02 20:44:12,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:12,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-02 20:44:12,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:12,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871502383] [2022-11-02 20:44:12,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871502383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:12,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:12,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:12,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760217045] [2022-11-02 20:44:12,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:12,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:12,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:12,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:12,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:12,796 INFO L87 Difference]: Start difference. First operand 641 states and 933 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:12,962 INFO L93 Difference]: Finished difference Result 1523 states and 2284 transitions. [2022-11-02 20:44:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:12,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 150 [2022-11-02 20:44:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:12,966 INFO L225 Difference]: With dead ends: 1523 [2022-11-02 20:44:12,967 INFO L226 Difference]: Without dead ends: 868 [2022-11-02 20:44:12,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:12,968 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 81 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:12,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 213 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-11-02 20:44:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 830. [2022-11-02 20:44:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.4294330518697225) internal successors, (1185), 829 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1185 transitions. [2022-11-02 20:44:12,995 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1185 transitions. Word has length 150 [2022-11-02 20:44:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:12,996 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1185 transitions. [2022-11-02 20:44:12,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1185 transitions. [2022-11-02 20:44:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-02 20:44:12,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:12,999 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 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] [2022-11-02 20:44:12,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:44:12,999 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1900103119, now seen corresponding path program 1 times [2022-11-02 20:44:13,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:13,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374110095] [2022-11-02 20:44:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-11-02 20:44:13,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:13,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374110095] [2022-11-02 20:44:13,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374110095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:13,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:13,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311899116] [2022-11-02 20:44:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:13,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:13,120 INFO L87 Difference]: Start difference. First operand 830 states and 1185 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:13,287 INFO L93 Difference]: Finished difference Result 1779 states and 2561 transitions. [2022-11-02 20:44:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:13,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 171 [2022-11-02 20:44:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:13,292 INFO L225 Difference]: With dead ends: 1779 [2022-11-02 20:44:13,295 INFO L226 Difference]: Without dead ends: 941 [2022-11-02 20:44:13,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:13,297 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:13,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 209 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-11-02 20:44:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 905. [2022-11-02 20:44:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 1.4170353982300885) internal successors, (1281), 904 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1281 transitions. [2022-11-02 20:44:13,328 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1281 transitions. Word has length 171 [2022-11-02 20:44:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:13,330 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1281 transitions. [2022-11-02 20:44:13,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1281 transitions. [2022-11-02 20:44:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-11-02 20:44:13,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:13,334 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1] [2022-11-02 20:44:13,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:44:13,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:13,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1650023748, now seen corresponding path program 1 times [2022-11-02 20:44:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:13,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457903885] [2022-11-02 20:44:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-11-02 20:44:13,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:13,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457903885] [2022-11-02 20:44:13,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457903885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:13,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:13,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:13,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486278570] [2022-11-02 20:44:13,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:13,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:13,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:13,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:13,453 INFO L87 Difference]: Start difference. First operand 905 states and 1281 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:13,619 INFO L93 Difference]: Finished difference Result 1929 states and 2750 transitions. [2022-11-02 20:44:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:13,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 195 [2022-11-02 20:44:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:13,623 INFO L225 Difference]: With dead ends: 1929 [2022-11-02 20:44:13,623 INFO L226 Difference]: Without dead ends: 1022 [2022-11-02 20:44:13,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:13,625 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 85 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:13,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 207 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-11-02 20:44:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 989. [2022-11-02 20:44:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.408906882591093) internal successors, (1392), 988 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1392 transitions. [2022-11-02 20:44:13,658 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1392 transitions. Word has length 195 [2022-11-02 20:44:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:13,659 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1392 transitions. [2022-11-02 20:44:13,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1392 transitions. [2022-11-02 20:44:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-11-02 20:44:13,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:13,663 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1] [2022-11-02 20:44:13,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:44:13,663 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1428789822, now seen corresponding path program 1 times [2022-11-02 20:44:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:13,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450708055] [2022-11-02 20:44:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-11-02 20:44:13,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:13,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450708055] [2022-11-02 20:44:13,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450708055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:13,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:13,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:13,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834928677] [2022-11-02 20:44:13,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:13,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:13,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:13,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:13,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:13,778 INFO L87 Difference]: Start difference. First operand 989 states and 1392 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:13,971 INFO L93 Difference]: Finished difference Result 2097 states and 2975 transitions. [2022-11-02 20:44:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:13,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 195 [2022-11-02 20:44:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:13,975 INFO L225 Difference]: With dead ends: 2097 [2022-11-02 20:44:13,975 INFO L226 Difference]: Without dead ends: 1118 [2022-11-02 20:44:13,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:13,978 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 87 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:13,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 205 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-11-02 20:44:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1082. [2022-11-02 20:44:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 1.4098057354301572) internal successors, (1524), 1081 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1524 transitions. [2022-11-02 20:44:14,015 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1524 transitions. Word has length 195 [2022-11-02 20:44:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:14,016 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1524 transitions. [2022-11-02 20:44:14,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1524 transitions. [2022-11-02 20:44:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-02 20:44:14,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:14,020 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:14,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:44:14,020 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash -390571940, now seen corresponding path program 1 times [2022-11-02 20:44:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:14,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647735666] [2022-11-02 20:44:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-02 20:44:14,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:14,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647735666] [2022-11-02 20:44:14,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647735666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:14,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:14,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208235042] [2022-11-02 20:44:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:14,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:14,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:14,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:14,145 INFO L87 Difference]: Start difference. First operand 1082 states and 1524 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:14,198 INFO L93 Difference]: Finished difference Result 3169 states and 4471 transitions. [2022-11-02 20:44:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 225 [2022-11-02 20:44:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:14,206 INFO L225 Difference]: With dead ends: 3169 [2022-11-02 20:44:14,206 INFO L226 Difference]: Without dead ends: 2124 [2022-11-02 20:44:14,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:14,209 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 124 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:14,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 478 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2022-11-02 20:44:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2122. [2022-11-02 20:44:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 1.4106553512494107) internal successors, (2992), 2121 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2992 transitions. [2022-11-02 20:44:14,306 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2992 transitions. Word has length 225 [2022-11-02 20:44:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:14,306 INFO L495 AbstractCegarLoop]: Abstraction has 2122 states and 2992 transitions. [2022-11-02 20:44:14,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2992 transitions. [2022-11-02 20:44:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-02 20:44:14,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:14,311 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:14,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:44:14,312 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1606725666, now seen corresponding path program 1 times [2022-11-02 20:44:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:14,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112554866] [2022-11-02 20:44:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-11-02 20:44:14,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:14,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112554866] [2022-11-02 20:44:14,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112554866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:14,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:14,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006760535] [2022-11-02 20:44:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:14,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:14,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:14,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:14,453 INFO L87 Difference]: Start difference. First operand 2122 states and 2992 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:14,659 INFO L93 Difference]: Finished difference Result 4513 states and 6403 transitions. [2022-11-02 20:44:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 225 [2022-11-02 20:44:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:14,668 INFO L225 Difference]: With dead ends: 4513 [2022-11-02 20:44:14,668 INFO L226 Difference]: Without dead ends: 2398 [2022-11-02 20:44:14,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:14,671 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 90 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:14,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 199 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2022-11-02 20:44:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2332. [2022-11-02 20:44:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2331 states have (on average 1.4174174174174174) internal successors, (3304), 2331 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3304 transitions. [2022-11-02 20:44:14,789 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3304 transitions. Word has length 225 [2022-11-02 20:44:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:14,790 INFO L495 AbstractCegarLoop]: Abstraction has 2332 states and 3304 transitions. [2022-11-02 20:44:14,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3304 transitions. [2022-11-02 20:44:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-11-02 20:44:14,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:14,797 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:14,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:44:14,797 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1762482343, now seen corresponding path program 1 times [2022-11-02 20:44:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:14,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112733835] [2022-11-02 20:44:14,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:14,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-11-02 20:44:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:14,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112733835] [2022-11-02 20:44:14,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112733835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:14,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:14,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534036666] [2022-11-02 20:44:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:14,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:14,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:14,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:14,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:14,933 INFO L87 Difference]: Start difference. First operand 2332 states and 3304 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:15,145 INFO L93 Difference]: Finished difference Result 4693 states and 6637 transitions. [2022-11-02 20:44:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:15,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 260 [2022-11-02 20:44:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:15,153 INFO L225 Difference]: With dead ends: 4693 [2022-11-02 20:44:15,154 INFO L226 Difference]: Without dead ends: 2380 [2022-11-02 20:44:15,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:15,157 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 93 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:15,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 194 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:15,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-11-02 20:44:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2314. [2022-11-02 20:44:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2313 states have (on average 1.4051015996541287) internal successors, (3250), 2313 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3250 transitions. [2022-11-02 20:44:15,268 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3250 transitions. Word has length 260 [2022-11-02 20:44:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:15,269 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3250 transitions. [2022-11-02 20:44:15,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3250 transitions. [2022-11-02 20:44:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-11-02 20:44:15,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:15,275 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:15,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:44:15,275 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:15,276 INFO L85 PathProgramCache]: Analyzing trace with hash 357446499, now seen corresponding path program 1 times [2022-11-02 20:44:15,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:15,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801885175] [2022-11-02 20:44:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:15,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-11-02 20:44:15,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:15,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801885175] [2022-11-02 20:44:15,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801885175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:15,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:15,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554231390] [2022-11-02 20:44:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:15,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:15,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:15,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:15,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:15,432 INFO L87 Difference]: Start difference. First operand 2314 states and 3250 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:15,561 INFO L93 Difference]: Finished difference Result 6879 states and 9664 transitions. [2022-11-02 20:44:15,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:15,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 270 [2022-11-02 20:44:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:15,577 INFO L225 Difference]: With dead ends: 6879 [2022-11-02 20:44:15,577 INFO L226 Difference]: Without dead ends: 4602 [2022-11-02 20:44:15,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:15,581 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 69 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:15,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 325 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2022-11-02 20:44:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4600. [2022-11-02 20:44:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4599 states have (on average 1.401174168297456) internal successors, (6444), 4599 states have internal predecessors, (6444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6444 transitions. [2022-11-02 20:44:15,775 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6444 transitions. Word has length 270 [2022-11-02 20:44:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:15,775 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6444 transitions. [2022-11-02 20:44:15,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6444 transitions. [2022-11-02 20:44:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-11-02 20:44:15,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:15,784 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:15,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:44:15,785 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:15,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash 259987815, now seen corresponding path program 1 times [2022-11-02 20:44:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:15,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145262273] [2022-11-02 20:44:15,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:44:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:15,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145262273] [2022-11-02 20:44:15,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145262273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:15,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:15,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639086798] [2022-11-02 20:44:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:15,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:15,899 INFO L87 Difference]: Start difference. First operand 4600 states and 6444 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:16,189 INFO L93 Difference]: Finished difference Result 9242 states and 12935 transitions. [2022-11-02 20:44:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 270 [2022-11-02 20:44:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:16,205 INFO L225 Difference]: With dead ends: 9242 [2022-11-02 20:44:16,205 INFO L226 Difference]: Without dead ends: 4708 [2022-11-02 20:44:16,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:16,211 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:16,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 253 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2022-11-02 20:44:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 4600. [2022-11-02 20:44:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4599 states have (on average 1.3776908023483365) internal successors, (6336), 4599 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6336 transitions. [2022-11-02 20:44:16,444 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6336 transitions. Word has length 270 [2022-11-02 20:44:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:16,445 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6336 transitions. [2022-11-02 20:44:16,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6336 transitions. [2022-11-02 20:44:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-11-02 20:44:16,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:16,459 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:16,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:44:16,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:16,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1955386571, now seen corresponding path program 1 times [2022-11-02 20:44:16,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:16,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205494631] [2022-11-02 20:44:16,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:16,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-11-02 20:44:16,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:16,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205494631] [2022-11-02 20:44:16,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205494631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:16,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:16,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779059949] [2022-11-02 20:44:16,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:16,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:16,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:16,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:16,617 INFO L87 Difference]: Start difference. First operand 4600 states and 6336 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:16,890 INFO L93 Difference]: Finished difference Result 9728 states and 13289 transitions. [2022-11-02 20:44:16,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 297 [2022-11-02 20:44:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:16,925 INFO L225 Difference]: With dead ends: 9728 [2022-11-02 20:44:16,925 INFO L226 Difference]: Without dead ends: 5194 [2022-11-02 20:44:16,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:16,937 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 106 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:16,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 189 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5194 states. [2022-11-02 20:44:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5194 to 4774. [2022-11-02 20:44:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4774 states, 4773 states have (on average 1.3764927718416091) internal successors, (6570), 4773 states have internal predecessors, (6570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 6570 transitions. [2022-11-02 20:44:17,182 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 6570 transitions. Word has length 297 [2022-11-02 20:44:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:17,182 INFO L495 AbstractCegarLoop]: Abstraction has 4774 states and 6570 transitions. [2022-11-02 20:44:17,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 6570 transitions. [2022-11-02 20:44:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-11-02 20:44:17,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:17,192 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:17,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:44:17,193 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:17,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash -950226577, now seen corresponding path program 1 times [2022-11-02 20:44:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:17,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331299134] [2022-11-02 20:44:17,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:17,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-11-02 20:44:17,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331299134] [2022-11-02 20:44:17,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331299134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:17,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:17,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021933124] [2022-11-02 20:44:17,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:17,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:17,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:17,329 INFO L87 Difference]: Start difference. First operand 4774 states and 6570 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:17,600 INFO L93 Difference]: Finished difference Result 9806 states and 13379 transitions. [2022-11-02 20:44:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:17,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 298 [2022-11-02 20:44:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:17,611 INFO L225 Difference]: With dead ends: 9806 [2022-11-02 20:44:17,611 INFO L226 Difference]: Without dead ends: 4594 [2022-11-02 20:44:17,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:17,618 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 39 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:17,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 261 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2022-11-02 20:44:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4576. [2022-11-02 20:44:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 4575 states have (on average 1.3718032786885246) internal successors, (6276), 4575 states have internal predecessors, (6276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 6276 transitions. [2022-11-02 20:44:17,854 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 6276 transitions. Word has length 298 [2022-11-02 20:44:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:17,855 INFO L495 AbstractCegarLoop]: Abstraction has 4576 states and 6276 transitions. [2022-11-02 20:44:17,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 6276 transitions. [2022-11-02 20:44:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-11-02 20:44:17,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:17,864 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:17,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:44:17,865 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:17,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash 977282003, now seen corresponding path program 1 times [2022-11-02 20:44:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:17,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687916728] [2022-11-02 20:44:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:44:18,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:18,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687916728] [2022-11-02 20:44:18,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687916728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:18,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381113540] [2022-11-02 20:44:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:18,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:18,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:18,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:18,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:44:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:18,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:44:18,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2022-11-02 20:44:18,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:44:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381113540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:18,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:44:18,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:44:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010991843] [2022-11-02 20:44:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:18,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:18,812 INFO L87 Difference]: Start difference. First operand 4576 states and 6276 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:18,990 INFO L93 Difference]: Finished difference Result 6867 states and 9400 transitions. [2022-11-02 20:44:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:18,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 308 [2022-11-02 20:44:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:19,001 INFO L225 Difference]: With dead ends: 6867 [2022-11-02 20:44:19,002 INFO L226 Difference]: Without dead ends: 4578 [2022-11-02 20:44:19,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:19,006 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 54 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:19,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 463 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2022-11-02 20:44:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 4564. [2022-11-02 20:44:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4563 states have (on average 1.3675213675213675) internal successors, (6240), 4563 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 6240 transitions. [2022-11-02 20:44:19,222 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 6240 transitions. Word has length 308 [2022-11-02 20:44:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:19,223 INFO L495 AbstractCegarLoop]: Abstraction has 4564 states and 6240 transitions. [2022-11-02 20:44:19,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 6240 transitions. [2022-11-02 20:44:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-11-02 20:44:19,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:19,235 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:19,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:19,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:44:19,450 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash -828156331, now seen corresponding path program 1 times [2022-11-02 20:44:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:19,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084624814] [2022-11-02 20:44:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:44:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:19,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084624814] [2022-11-02 20:44:19,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084624814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:19,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924004897] [2022-11-02 20:44:19,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:19,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:19,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:44:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:19,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:44:19,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:44:19,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:44:20,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924004897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:20,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:20,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:44:20,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417258923] [2022-11-02 20:44:20,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:20,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:20,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:20,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:20,047 INFO L87 Difference]: Start difference. First operand 4564 states and 6240 transitions. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:20,609 INFO L93 Difference]: Finished difference Result 8128 states and 11217 transitions. [2022-11-02 20:44:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:44:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 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 308 [2022-11-02 20:44:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:20,622 INFO L225 Difference]: With dead ends: 8128 [2022-11-02 20:44:20,622 INFO L226 Difference]: Without dead ends: 5731 [2022-11-02 20:44:20,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:20,626 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 361 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:20,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 703 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:44:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5731 states. [2022-11-02 20:44:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5731 to 4758. [2022-11-02 20:44:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 4757 states have (on average 1.3727138953121716) internal successors, (6530), 4757 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6530 transitions. [2022-11-02 20:44:20,792 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6530 transitions. Word has length 308 [2022-11-02 20:44:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:20,793 INFO L495 AbstractCegarLoop]: Abstraction has 4758 states and 6530 transitions. [2022-11-02 20:44:20,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6530 transitions. [2022-11-02 20:44:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-11-02 20:44:20,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:20,803 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:20,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:21,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:44:21,030 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash 105807153, now seen corresponding path program 1 times [2022-11-02 20:44:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:21,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493169028] [2022-11-02 20:44:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:44:21,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:21,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493169028] [2022-11-02 20:44:21,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493169028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:21,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822189243] [2022-11-02 20:44:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:21,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:21,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:21,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:44:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:44:21,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:44:21,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:44:21,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822189243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:21,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:21,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-02 20:44:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152226568] [2022-11-02 20:44:21,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:21,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:44:21,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:21,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:44:21,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:21,555 INFO L87 Difference]: Start difference. First operand 4758 states and 6530 transitions. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:21,955 INFO L93 Difference]: Finished difference Result 6125 states and 8428 transitions. [2022-11-02 20:44:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 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 309 [2022-11-02 20:44:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:21,960 INFO L225 Difference]: With dead ends: 6125 [2022-11-02 20:44:21,961 INFO L226 Difference]: Without dead ends: 2534 [2022-11-02 20:44:21,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:21,965 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 130 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:21,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 608 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:44:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2022-11-02 20:44:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2460. [2022-11-02 20:44:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2459 states have (on average 1.3782025213501423) internal successors, (3389), 2459 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3389 transitions. [2022-11-02 20:44:22,051 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3389 transitions. Word has length 309 [2022-11-02 20:44:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:22,051 INFO L495 AbstractCegarLoop]: Abstraction has 2460 states and 3389 transitions. [2022-11-02 20:44:22,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3389 transitions. [2022-11-02 20:44:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2022-11-02 20:44:22,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:22,059 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:22,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:22,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 20:44:22,286 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2136036892, now seen corresponding path program 1 times [2022-11-02 20:44:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:22,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768228444] [2022-11-02 20:44:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-11-02 20:44:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:22,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768228444] [2022-11-02 20:44:22,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768228444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:22,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043861014] [2022-11-02 20:44:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:22,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:22,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:44:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:22,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:44:22,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-11-02 20:44:22,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-11-02 20:44:22,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043861014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:22,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:44:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341540207] [2022-11-02 20:44:22,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:22,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:22,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:22,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:22,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:22,776 INFO L87 Difference]: Start difference. First operand 2460 states and 3389 transitions. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:23,045 INFO L93 Difference]: Finished difference Result 3515 states and 4790 transitions. [2022-11-02 20:44:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:44:23,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 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 334 [2022-11-02 20:44:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:23,046 INFO L225 Difference]: With dead ends: 3515 [2022-11-02 20:44:23,046 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:44:23,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:23,050 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 111 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:23,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 358 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:44:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:44:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:44:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:44:23,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 334 [2022-11-02 20:44:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:23,052 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:44:23,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:44:23,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:44:23,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:44:23,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:44:23,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:44:23,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:44:27,844 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2022-11-02 20:44:27,844 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 252) no Hoare annotation was computed. [2022-11-02 20:44:27,844 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 551) no Hoare annotation was computed. [2022-11-02 20:44:27,844 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 562) no Hoare annotation was computed. [2022-11-02 20:44:27,844 INFO L899 garLoopResultBuilder]: For program point L235-2(lines 213 545) no Hoare annotation was computed. [2022-11-02 20:44:27,844 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 573) no Hoare annotation was computed. [2022-11-02 20:44:27,845 INFO L895 garLoopResultBuilder]: At program point L203(lines 199 552) the Hoare annotation is: (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) [2022-11-02 20:44:27,845 INFO L895 garLoopResultBuilder]: At program point L137(lines 133 574) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1) .cse1) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1))) [2022-11-02 20:44:27,845 INFO L899 garLoopResultBuilder]: For program point L501-1(lines 501 513) no Hoare annotation was computed. [2022-11-02 20:44:27,845 INFO L899 garLoopResultBuilder]: For program point L435(lines 435 439) no Hoare annotation was computed. [2022-11-02 20:44:27,845 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 242) no Hoare annotation was computed. [2022-11-02 20:44:27,845 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 550) no Hoare annotation was computed. [2022-11-02 20:44:27,845 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 561) no Hoare annotation was computed. [2022-11-02 20:44:27,845 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 572) no Hoare annotation was computed. [2022-11-02 20:44:27,845 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L895 garLoopResultBuilder]: At program point L206(lines 205 550) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 .cse3 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse1 (not .cse0) .cse2 .cse3) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2))) [2022-11-02 20:44:27,846 INFO L895 garLoopResultBuilder]: At program point L173(lines 163 564) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 509) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 482) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L471-1(lines 471 482) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 213 545) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 410) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 344) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 213 545) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 549) no Hoare annotation was computed. [2022-11-02 20:44:27,846 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 560) no Hoare annotation was computed. [2022-11-02 20:44:27,847 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 571) no Hoare annotation was computed. [2022-11-02 20:44:27,847 INFO L895 garLoopResultBuilder]: At program point L109-1(lines 76 630) the Hoare annotation is: (let ((.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528) .cse0) (and (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse4 (not .cse2) .cse5 .cse0) (and (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse1) (and .cse2 .cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 .cse6) (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) [2022-11-02 20:44:27,847 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 479) no Hoare annotation was computed. [2022-11-02 20:44:27,847 INFO L902 garLoopResultBuilder]: At program point L209(lines 208 549) the Hoare annotation is: true [2022-11-02 20:44:27,847 INFO L895 garLoopResultBuilder]: At program point L143(lines 139 572) the Hoare annotation is: (and (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (< 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) [2022-11-02 20:44:27,847 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-11-02 20:44:27,847 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2022-11-02 20:44:27,847 INFO L902 garLoopResultBuilder]: At program point L640(lines 632 642) the Hoare annotation is: true [2022-11-02 20:44:27,847 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 559) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 570) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 581) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L443-2(lines 213 545) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L902 garLoopResultBuilder]: At program point L212(lines 211 548) the Hoare annotation is: true [2022-11-02 20:44:27,848 INFO L895 garLoopResultBuilder]: At program point L179(lines 175 560) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-11-02 20:44:27,848 INFO L895 garLoopResultBuilder]: At program point L113(lines 112 581) the Hoare annotation is: (let ((.cse0 (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0) (and .cse0 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 417) no Hoare annotation was computed. [2022-11-02 20:44:27,848 INFO L899 garLoopResultBuilder]: For program point L412-2(lines 412 417) no Hoare annotation was computed. [2022-11-02 20:44:27,849 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 558) no Hoare annotation was computed. [2022-11-02 20:44:27,849 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 569) no Hoare annotation was computed. [2022-11-02 20:44:27,849 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 580) no Hoare annotation was computed. [2022-11-02 20:44:27,849 INFO L895 garLoopResultBuilder]: At program point L149(lines 145 570) the Hoare annotation is: (and (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432) (< 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:27,849 INFO L895 garLoopResultBuilder]: At program point L546(lines 109 612) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528) .cse0) (and (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse0 .cse5) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse3 (not .cse1) .cse4 .cse0) (and .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 .cse5) (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) [2022-11-02 20:44:27,849 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 92) no Hoare annotation was computed. [2022-11-02 20:44:27,849 INFO L902 garLoopResultBuilder]: At program point L613(lines 108 614) the Hoare annotation is: true [2022-11-02 20:44:27,849 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 557) no Hoare annotation was computed. [2022-11-02 20:44:27,849 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 568) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 579) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L895 garLoopResultBuilder]: At program point L218(lines 115 580) the Hoare annotation is: (or (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (and (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0))) [2022-11-02 20:44:27,850 INFO L895 garLoopResultBuilder]: At program point L185(lines 181 558) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 610) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 84 92) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 607) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 213 545) no Hoare annotation was computed. [2022-11-02 20:44:27,850 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 357) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 319 333) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 556) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 567) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 578) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 593) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L617-2(lines 617 621) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L584-2(lines 583 605) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L895 garLoopResultBuilder]: At program point L155(lines 151 568) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 459) no Hoare annotation was computed. [2022-11-02 20:44:27,851 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 555) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 566) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 213 545) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 577) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 321 333) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L895 garLoopResultBuilder]: At program point L191(lines 187 556) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L522-1(lines 522 526) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-02 20:44:27,852 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 554) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 565) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 576) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 76 630) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L895 garLoopResultBuilder]: At program point L161(lines 157 566) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 303) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 553) no Hoare annotation was computed. [2022-11-02 20:44:27,853 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 564) no Hoare annotation was computed. [2022-11-02 20:44:27,854 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 575) no Hoare annotation was computed. [2022-11-02 20:44:27,859 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-11-02 20:44:27,859 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2022-11-02 20:44:27,859 INFO L895 garLoopResultBuilder]: At program point L197(lines 193 554) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) .cse1) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) .cse1))) [2022-11-02 20:44:27,860 INFO L895 garLoopResultBuilder]: At program point L131(lines 127 576) the Hoare annotation is: (let ((.cse0 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1))) [2022-11-02 20:44:27,860 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:44:27,860 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2022-11-02 20:44:27,860 INFO L895 garLoopResultBuilder]: At program point L363(lines 76 630) the Hoare annotation is: false [2022-11-02 20:44:27,860 INFO L902 garLoopResultBuilder]: At program point L628(lines 76 630) the Hoare annotation is: true [2022-11-02 20:44:27,861 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 601) no Hoare annotation was computed. [2022-11-02 20:44:27,861 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2022-11-02 20:44:27,861 INFO L899 garLoopResultBuilder]: For program point L529-2(lines 529 533) no Hoare annotation was computed. [2022-11-02 20:44:27,861 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 302) no Hoare annotation was computed. [2022-11-02 20:44:27,861 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 213 545) no Hoare annotation was computed. [2022-11-02 20:44:27,861 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 552) no Hoare annotation was computed. [2022-11-02 20:44:27,861 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 563) no Hoare annotation was computed. [2022-11-02 20:44:27,861 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 574) no Hoare annotation was computed. [2022-11-02 20:44:27,862 INFO L902 garLoopResultBuilder]: At program point L629(lines 18 631) the Hoare annotation is: true [2022-11-02 20:44:27,862 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 468) no Hoare annotation was computed. [2022-11-02 20:44:27,866 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:27,868 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:44:27,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:44:27 BoogieIcfgContainer [2022-11-02 20:44:27,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:44:27,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:44:27,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:44:27,904 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:44:27,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:09" (3/4) ... [2022-11-02 20:44:27,907 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:44:27,932 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-02 20:44:27,932 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:44:27,933 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:44:27,933 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:44:28,044 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:44:28,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:44:28,045 INFO L158 Benchmark]: Toolchain (without parser) took 19697.74ms. Allocated memory was 109.1MB in the beginning and 641.7MB in the end (delta: 532.7MB). Free memory was 66.7MB in the beginning and 228.9MB in the end (delta: -162.2MB). Peak memory consumption was 368.6MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,046 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:44:28,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.01ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 79.7MB in the end (delta: -13.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.09ms. Allocated memory is still 109.1MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,047 INFO L158 Benchmark]: Boogie Preprocessor took 36.02ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,047 INFO L158 Benchmark]: RCFGBuilder took 810.16ms. Allocated memory is still 109.1MB. Free memory was 74.7MB in the beginning and 84.2MB in the end (delta: -9.5MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,050 INFO L158 Benchmark]: TraceAbstraction took 18195.78ms. Allocated memory was 109.1MB in the beginning and 641.7MB in the end (delta: 532.7MB). Free memory was 83.5MB in the beginning and 236.3MB in the end (delta: -152.7MB). Peak memory consumption was 434.3MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,050 INFO L158 Benchmark]: Witness Printer took 140.97ms. Allocated memory is still 641.7MB. Free memory was 236.3MB in the beginning and 228.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,055 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.01ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 79.7MB in the end (delta: -13.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.09ms. Allocated memory is still 109.1MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.02ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 810.16ms. Allocated memory is still 109.1MB. Free memory was 74.7MB in the beginning and 84.2MB in the end (delta: -9.5MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18195.78ms. Allocated memory was 109.1MB in the beginning and 641.7MB in the end (delta: 532.7MB). Free memory was 83.5MB in the beginning and 236.3MB in the end (delta: -152.7MB). Peak memory consumption was 434.3MB. Max. memory is 16.1GB. * Witness Printer took 140.97ms. Allocated memory is still 641.7MB. Free memory was 236.3MB in the beginning and 228.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 24, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1980 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1980 mSDsluCounter, 7485 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2896 mSDsCounter, 587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2536 IncrementalHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 587 mSolverCounterUnsat, 4589 mSDtfsCounter, 2536 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2289 GetRequests, 2247 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4774occurred in iteration=19, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 1923 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 301 NumberOfFragments, 432 HoareAnnotationTreeSize, 24 FomulaSimplifications, 73382 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 24 FomulaSimplificationsInter, 6251 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 5691 NumberOfCodeBlocks, 5691 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6611 ConstructedInterpolants, 0 QuantifiedInterpolants, 9344 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2303 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 31 InterpolantComputations, 21 PerfectInterpolantSequences, 20382/20481 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((4384 == s__state && blastFlag == 1) || ((4432 <= s__state && s__state <= 4528) && blastFlag <= 4)) || (4416 == s__state && blastFlag <= 4)) || 2 == blastFlag) || (4368 == s__state && blastFlag == 0)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || ((((3 == s__s3__tmp__next_state___0 && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && blastFlag <= 4)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || 3 == s__state - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((((((4384 == s__state && blastFlag == 1) || ((4432 <= s__state && s__state <= 4528) && blastFlag <= 4)) || (4416 == s__state && blastFlag <= 4)) || 2 == blastFlag) || (4368 == s__state && blastFlag == 0)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || ((((3 == s__s3__tmp__next_state___0 && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && blastFlag <= 4)) || (12292 == s__state && blastFlag == 0)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || 3 == s__state - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4480) && blastFlag <= 4 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 2 == blastFlag || (s__state <= 4352 && blastFlag == 0) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (4432 <= s__state && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((4432 <= s__state && !(s__hit == 0)) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag <= 4) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (s__state <= 4432 && 4384 < s__state) && blastFlag <= 4 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((4352 <= s__state && s__state < 4384) && blastFlag == 0) || ((2 == blastFlag && 4352 <= s__state) && s__state < 4384) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (2 == blastFlag && 12292 == s__state) || (12292 == s__state && blastFlag == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__hit == 0) || (2 == blastFlag && 4560 <= s__state) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4464) && blastFlag <= 4 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((s__state <= 4432 && blastFlag == 1) && 4352 <= s__state) || ((s__state <= 4432 && 2 == blastFlag) && 4352 <= s__state) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4528) && blastFlag <= 4 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (4432 <= s__state && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (s__state <= 4432 && 2 == blastFlag) && 4384 < s__state - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4448) && blastFlag <= 4 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) || ((((3 == s__s3__tmp__next_state___0 && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && blastFlag <= 4)) || ((2 == blastFlag && s__state <= 4352) && 4352 <= s__state) RESULT: Ultimate proved your program to be correct! [2022-11-02 20:44:28,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b054a958-613e-42bd-98be-ede495286621/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE