./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/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_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/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_5716ea50-a6fa-4038-9444-73d8222a4e4d/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 cd6854ce29c7bf580cd3e782b287f65f1203c66552ea1ec9f0128f94f0f3ec92 --- 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:52:19,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:52:19,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:52:19,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:52:19,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:52:19,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:52:19,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:52:19,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:52:19,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:52:19,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:52:19,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:52:19,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:52:19,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:52:19,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:52:19,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:52:19,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:52:19,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:52:19,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:52:19,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:52:19,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:52:19,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:52:19,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:52:19,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:52:19,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:52:19,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:52:19,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:52:19,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:52:19,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:52:19,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:52:19,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:52:19,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:52:19,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:52:19,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:52:19,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:52:19,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:52:19,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:52:19,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:52:19,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:52:19,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:52:19,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:52:19,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:52:19,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:52:19,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:52:19,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:52:19,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:52:19,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:52:19,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:52:19,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:52:19,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:52:19,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:52:19,249 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:52:19,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:52:19,250 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:52:19,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:52:19,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:52:19,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:52:19,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:52:19,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:52:19,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:52:19,252 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:52:19,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:52:19,252 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:52:19,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:52:19,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:52:19,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:52:19,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:52:19,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:19,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:52:19,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:52:19,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:52:19,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:52:19,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:52:19,254 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:52:19,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:52:19,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:52:19,255 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_5716ea50-a6fa-4038-9444-73d8222a4e4d/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_5716ea50-a6fa-4038-9444-73d8222a4e4d/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 -> cd6854ce29c7bf580cd3e782b287f65f1203c66552ea1ec9f0128f94f0f3ec92 [2022-11-02 20:52:19,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:52:19,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:52:19,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:52:19,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:52:19,574 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:52:19,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c [2022-11-02 20:52:19,651 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/data/3524ac302/79cb2a1fa4dd4bb59b29420d29e6a3b4/FLAGbccf1a58b [2022-11-02 20:52:20,251 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:52:20,253 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c [2022-11-02 20:52:20,267 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/data/3524ac302/79cb2a1fa4dd4bb59b29420d29e6a3b4/FLAGbccf1a58b [2022-11-02 20:52:20,544 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/data/3524ac302/79cb2a1fa4dd4bb59b29420d29e6a3b4 [2022-11-02 20:52:20,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:52:20,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:52:20,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:20,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:52:20,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:52:20,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:20,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204179db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20, skipping insertion in model container [2022-11-02 20:52:20,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:20,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:52:20,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:52:20,870 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_5716ea50-a6fa-4038-9444-73d8222a4e4d/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c[37413,37426] [2022-11-02 20:52:20,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:20,890 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:52:20,939 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_5716ea50-a6fa-4038-9444-73d8222a4e4d/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c[37413,37426] [2022-11-02 20:52:20,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:20,956 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:52:20,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20 WrapperNode [2022-11-02 20:52:20,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:20,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:20,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:52:20,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:52:20,970 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:52:20" (1/1) ... [2022-11-02 20:52:20,978 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:52:20" (1/1) ... [2022-11-02 20:52:21,020 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 475 [2022-11-02 20:52:21,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:21,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:52:21,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:52:21,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:52:21,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,050 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:52:21,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:52:21,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:52:21,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:52:21,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (1/1) ... [2022-11-02 20:52:21,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:21,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:21,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:52:21,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:52:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:52:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:52:21,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:52:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:52:21,343 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:52:21,345 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:52:21,374 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:52:21,994 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-11-02 20:52:21,994 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-11-02 20:52:21,995 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:52:22,028 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:52:22,029 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:52:22,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:22 BoogieIcfgContainer [2022-11-02 20:52:22,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:52:22,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:52:22,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:52:22,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:52:22,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:52:20" (1/3) ... [2022-11-02 20:52:22,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5f695d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:22, skipping insertion in model container [2022-11-02 20:52:22,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:20" (2/3) ... [2022-11-02 20:52:22,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5f695d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:22, skipping insertion in model container [2022-11-02 20:52:22,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:22" (3/3) ... [2022-11-02 20:52:22,046 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2022-11-02 20:52:22,081 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:52:22,081 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:52:22,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:52:22,149 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;@5c0e2308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:52:22,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:52:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 123 states have internal predecessors, (212), 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:52:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:52:22,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:22,174 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] [2022-11-02 20:52:22,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:22,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2022-11-02 20:52:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:22,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890097207] [2022-11-02 20:52:22,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:22,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:22,663 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:52:22,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:22,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890097207] [2022-11-02 20:52:22,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890097207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:22,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:22,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577149771] [2022-11-02 20:52:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:22,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:22,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:22,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:22,719 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 123 states have internal predecessors, (212), 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.0) internal successors, (24), 3 states have internal predecessors, (24), 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:52:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:22,975 INFO L93 Difference]: Finished difference Result 244 states and 419 transitions. [2022-11-02 20:52:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:22,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-11-02 20:52:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:22,998 INFO L225 Difference]: With dead ends: 244 [2022-11-02 20:52:22,998 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:52:23,003 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:52:23,009 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:23,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 317 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:52:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-02 20:52:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 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:52:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2022-11-02 20:52:23,083 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2022-11-02 20:52:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:23,084 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2022-11-02 20:52:23,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:52:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2022-11-02 20:52:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:52:23,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:23,089 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] [2022-11-02 20:52:23,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:52:23,090 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2022-11-02 20:52:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:23,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235568371] [2022-11-02 20:52:23,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,178 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:52:23,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:23,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235568371] [2022-11-02 20:52:23,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235568371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:23,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:23,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580542345] [2022-11-02 20:52:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:23,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:23,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:23,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:23,186 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:52:23,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:23,334 INFO L93 Difference]: Finished difference Result 232 states and 354 transitions. [2022-11-02 20:52:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:23,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-11-02 20:52:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:23,336 INFO L225 Difference]: With dead ends: 232 [2022-11-02 20:52:23,336 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:52:23,337 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:52:23,338 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:23,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 238 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:52:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-11-02 20:52:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 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:52:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2022-11-02 20:52:23,349 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2022-11-02 20:52:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:23,350 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2022-11-02 20:52:23,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:52:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2022-11-02 20:52:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:52:23,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:23,352 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] [2022-11-02 20:52:23,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:52:23,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash -114868729, now seen corresponding path program 1 times [2022-11-02 20:52:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:23,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143595949] [2022-11-02 20:52:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,497 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:52:23,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:23,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143595949] [2022-11-02 20:52:23,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143595949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:23,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:23,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738711973] [2022-11-02 20:52:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:23,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:23,502 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:52:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:23,622 INFO L93 Difference]: Finished difference Result 266 states and 402 transitions. [2022-11-02 20:52:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:23,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 50 [2022-11-02 20:52:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:23,624 INFO L225 Difference]: With dead ends: 266 [2022-11-02 20:52:23,625 INFO L226 Difference]: Without dead ends: 149 [2022-11-02 20:52:23,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:52:23,626 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:23,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 251 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-02 20:52:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2022-11-02 20:52:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 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:52:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2022-11-02 20:52:23,636 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2022-11-02 20:52:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:23,637 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2022-11-02 20:52:23,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:52:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2022-11-02 20:52:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:52:23,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:23,639 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] [2022-11-02 20:52:23,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:52:23,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -682645784, now seen corresponding path program 1 times [2022-11-02 20:52:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:23,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843854099] [2022-11-02 20:52:23,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,727 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:52:23,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843854099] [2022-11-02 20:52:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843854099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:23,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:23,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70798330] [2022-11-02 20:52:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:23,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:23,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:23,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:23,730 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:52:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:23,895 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2022-11-02 20:52:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:23,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 67 [2022-11-02 20:52:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:23,897 INFO L225 Difference]: With dead ends: 328 [2022-11-02 20:52:23,897 INFO L226 Difference]: Without dead ends: 193 [2022-11-02 20:52:23,898 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:52:23,899 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 52 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:23,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 224 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-02 20:52:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2022-11-02 20:52:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4184782608695652) internal successors, (261), 184 states have internal predecessors, (261), 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:52:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2022-11-02 20:52:23,909 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2022-11-02 20:52:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:23,910 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2022-11-02 20:52:23,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:52:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2022-11-02 20:52:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:52:23,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:23,912 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] [2022-11-02 20:52:23,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:52:23,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:23,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1806883178, now seen corresponding path program 1 times [2022-11-02 20:52:23,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:23,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634049703] [2022-11-02 20:52:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,974 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:52:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634049703] [2022-11-02 20:52:23,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634049703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:23,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:23,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770573403] [2022-11-02 20:52:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:23,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:23,977 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:52:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:24,098 INFO L93 Difference]: Finished difference Result 383 states and 548 transitions. [2022-11-02 20:52:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 67 [2022-11-02 20:52:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:24,100 INFO L225 Difference]: With dead ends: 383 [2022-11-02 20:52:24,100 INFO L226 Difference]: Without dead ends: 208 [2022-11-02 20:52:24,103 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:52:24,106 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:24,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 256 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-02 20:52:24,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2022-11-02 20:52:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4039408866995073) internal successors, (285), 203 states have internal predecessors, (285), 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:52:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2022-11-02 20:52:24,116 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2022-11-02 20:52:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:24,116 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2022-11-02 20:52:24,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:52:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2022-11-02 20:52:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:52:24,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:24,118 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] [2022-11-02 20:52:24,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:52:24,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:24,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash 170492736, now seen corresponding path program 1 times [2022-11-02 20:52:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:24,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109906013] [2022-11-02 20:52:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:24,214 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:52:24,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:24,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109906013] [2022-11-02 20:52:24,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109906013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:24,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:24,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080533422] [2022-11-02 20:52:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:24,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:24,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:24,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:24,217 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:52:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:24,343 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2022-11-02 20:52:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:24,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-02 20:52:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:24,347 INFO L225 Difference]: With dead ends: 422 [2022-11-02 20:52:24,348 INFO L226 Difference]: Without dead ends: 228 [2022-11-02 20:52:24,349 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:52:24,356 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:24,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 255 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-02 20:52:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2022-11-02 20:52:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3883928571428572) internal successors, (311), 224 states have internal predecessors, (311), 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:52:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2022-11-02 20:52:24,372 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2022-11-02 20:52:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:24,373 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2022-11-02 20:52:24,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:52:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2022-11-02 20:52:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:52:24,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:24,375 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] [2022-11-02 20:52:24,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:52:24,375 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1976749000, now seen corresponding path program 1 times [2022-11-02 20:52:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:24,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581056393] [2022-11-02 20:52:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:52:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581056393] [2022-11-02 20:52:24,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581056393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:24,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:24,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:24,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243600381] [2022-11-02 20:52:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:24,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:24,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:24,490 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:52:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:24,524 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2022-11-02 20:52:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:24,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 103 [2022-11-02 20:52:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:24,527 INFO L225 Difference]: With dead ends: 652 [2022-11-02 20:52:24,527 INFO L226 Difference]: Without dead ends: 437 [2022-11-02 20:52:24,528 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:52:24,528 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 356 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:52:24,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 356 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-02 20:52:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2022-11-02 20:52:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.3761467889908257) internal successors, (600), 436 states have internal predecessors, (600), 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:52:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 600 transitions. [2022-11-02 20:52:24,542 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 600 transitions. Word has length 103 [2022-11-02 20:52:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:24,542 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 600 transitions. [2022-11-02 20:52:24,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:52:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 600 transitions. [2022-11-02 20:52:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:52:24,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:24,544 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] [2022-11-02 20:52:24,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:52:24,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:24,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash -102965200, now seen corresponding path program 1 times [2022-11-02 20:52:24,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:24,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926582664] [2022-11-02 20:52:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:24,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:52:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926582664] [2022-11-02 20:52:24,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926582664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:24,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:24,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036081941] [2022-11-02 20:52:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:24,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:24,606 INFO L87 Difference]: Start difference. First operand 437 states and 600 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:52:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:24,653 INFO L93 Difference]: Finished difference Result 885 states and 1214 transitions. [2022-11-02 20:52:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:24,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 104 [2022-11-02 20:52:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:24,656 INFO L225 Difference]: With dead ends: 885 [2022-11-02 20:52:24,656 INFO L226 Difference]: Without dead ends: 458 [2022-11-02 20:52:24,657 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:52:24,657 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 11 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 337 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:52:24,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-02 20:52:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2022-11-02 20:52:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.3719912472647702) internal successors, (627), 457 states have internal predecessors, (627), 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:52:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 627 transitions. [2022-11-02 20:52:24,681 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 627 transitions. Word has length 104 [2022-11-02 20:52:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:24,681 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 627 transitions. [2022-11-02 20:52:24,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:52:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 627 transitions. [2022-11-02 20:52:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:52:24,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:24,683 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] [2022-11-02 20:52:24,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:52:24,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 736068462, now seen corresponding path program 1 times [2022-11-02 20:52:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:24,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176663506] [2022-11-02 20:52:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-02 20:52:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176663506] [2022-11-02 20:52:24,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176663506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:24,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:24,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867220280] [2022-11-02 20:52:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:24,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:24,746 INFO L87 Difference]: Start difference. First operand 458 states and 627 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:52:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:24,779 INFO L93 Difference]: Finished difference Result 932 states and 1274 transitions. [2022-11-02 20:52:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:24,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 104 [2022-11-02 20:52:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:24,782 INFO L225 Difference]: With dead ends: 932 [2022-11-02 20:52:24,783 INFO L226 Difference]: Without dead ends: 484 [2022-11-02 20:52:24,784 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:52:24,786 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 309 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:52:24,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-02 20:52:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2022-11-02 20:52:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3664596273291925) internal successors, (660), 483 states have internal predecessors, (660), 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:52:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 660 transitions. [2022-11-02 20:52:24,806 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 660 transitions. Word has length 104 [2022-11-02 20:52:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:24,806 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 660 transitions. [2022-11-02 20:52:24,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:52:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 660 transitions. [2022-11-02 20:52:24,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 20:52:24,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:24,809 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] [2022-11-02 20:52:24,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:52:24,809 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1108389378, now seen corresponding path program 1 times [2022-11-02 20:52:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:24,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165697076] [2022-11-02 20:52:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:24,910 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:52:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:24,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165697076] [2022-11-02 20:52:24,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165697076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:24,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:24,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:24,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096660248] [2022-11-02 20:52:24,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:24,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:24,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:24,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:24,915 INFO L87 Difference]: Start difference. First operand 484 states and 660 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:24,980 INFO L93 Difference]: Finished difference Result 699 states and 957 transitions. [2022-11-02 20:52:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:24,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-11-02 20:52:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:24,984 INFO L225 Difference]: With dead ends: 699 [2022-11-02 20:52:24,984 INFO L226 Difference]: Without dead ends: 697 [2022-11-02 20:52:24,984 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:52:24,985 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 136 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 299 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:24,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 299 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-02 20:52:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2022-11-02 20:52:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.3721264367816093) internal successors, (955), 696 states have internal predecessors, (955), 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:52:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2022-11-02 20:52:25,011 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 105 [2022-11-02 20:52:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:25,012 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2022-11-02 20:52:25,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2022-11-02 20:52:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-02 20:52:25,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:25,018 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 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] [2022-11-02 20:52:25,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:52:25,022 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash -391134295, now seen corresponding path program 1 times [2022-11-02 20:52:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:25,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946613920] [2022-11-02 20:52:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-02 20:52:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:25,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946613920] [2022-11-02 20:52:25,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946613920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:25,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:25,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209418686] [2022-11-02 20:52:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:25,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:25,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:25,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:25,170 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:52:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:25,345 INFO L93 Difference]: Finished difference Result 1508 states and 2127 transitions. [2022-11-02 20:52:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:25,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 159 [2022-11-02 20:52:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:25,350 INFO L225 Difference]: With dead ends: 1508 [2022-11-02 20:52:25,350 INFO L226 Difference]: Without dead ends: 844 [2022-11-02 20:52:25,352 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:52:25,353 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 94 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:25,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 190 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-11-02 20:52:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 814. [2022-11-02 20:52:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.4071340713407134) internal successors, (1144), 813 states have internal predecessors, (1144), 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:52:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1144 transitions. [2022-11-02 20:52:25,377 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1144 transitions. Word has length 159 [2022-11-02 20:52:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:25,384 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1144 transitions. [2022-11-02 20:52:25,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:52:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1144 transitions. [2022-11-02 20:52:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-02 20:52:25,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:25,387 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 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, 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] [2022-11-02 20:52:25,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:52:25,388 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash -408594384, now seen corresponding path program 1 times [2022-11-02 20:52:25,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:25,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401509662] [2022-11-02 20:52:25,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-11-02 20:52:25,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:25,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401509662] [2022-11-02 20:52:25,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401509662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:25,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:25,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87209449] [2022-11-02 20:52:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:25,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:25,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:25,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:25,500 INFO L87 Difference]: Start difference. First operand 814 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:52:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:25,671 INFO L93 Difference]: Finished difference Result 1870 states and 2708 transitions. [2022-11-02 20:52:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 185 [2022-11-02 20:52:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:25,675 INFO L225 Difference]: With dead ends: 1870 [2022-11-02 20:52:25,676 INFO L226 Difference]: Without dead ends: 1041 [2022-11-02 20:52:25,677 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:52:25,677 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 93 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:25,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 198 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2022-11-02 20:52:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1003. [2022-11-02 20:52:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.3932135728542914) internal successors, (1396), 1002 states have internal predecessors, (1396), 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:52:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1396 transitions. [2022-11-02 20:52:25,712 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1396 transitions. Word has length 185 [2022-11-02 20:52:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:25,712 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1396 transitions. [2022-11-02 20:52:25,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:52:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1396 transitions. [2022-11-02 20:52:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-02 20:52:25,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:25,716 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:25,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:52:25,717 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash -585141096, now seen corresponding path program 1 times [2022-11-02 20:52:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:25,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427376919] [2022-11-02 20:52:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-02 20:52:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:25,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427376919] [2022-11-02 20:52:25,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427376919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:25,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:25,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27251246] [2022-11-02 20:52:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:25,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:25,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:25,836 INFO L87 Difference]: Start difference. First operand 1003 states and 1396 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:52:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:26,014 INFO L93 Difference]: Finished difference Result 2126 states and 2985 transitions. [2022-11-02 20:52:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:26,015 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 206 [2022-11-02 20:52:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:26,019 INFO L225 Difference]: With dead ends: 2126 [2022-11-02 20:52:26,019 INFO L226 Difference]: Without dead ends: 1114 [2022-11-02 20:52:26,021 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:52:26,022 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 96 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:26,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 194 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2022-11-02 20:52:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1078. [2022-11-02 20:52:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.3853296193129063) internal successors, (1492), 1077 states have internal predecessors, (1492), 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:52:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1492 transitions. [2022-11-02 20:52:26,055 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1492 transitions. Word has length 206 [2022-11-02 20:52:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:26,056 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 1492 transitions. [2022-11-02 20:52:26,056 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:52:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1492 transitions. [2022-11-02 20:52:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-11-02 20:52:26,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:26,061 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 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, 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:52:26,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:52:26,061 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2110600453, now seen corresponding path program 1 times [2022-11-02 20:52:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:26,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484102485] [2022-11-02 20:52:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-02 20:52:26,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:26,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484102485] [2022-11-02 20:52:26,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484102485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:26,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:26,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728131120] [2022-11-02 20:52:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:26,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:26,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:26,201 INFO L87 Difference]: Start difference. First operand 1078 states and 1492 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:52:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:26,409 INFO L93 Difference]: Finished difference Result 2276 states and 3174 transitions. [2022-11-02 20:52:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:26,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 230 [2022-11-02 20:52:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:26,415 INFO L225 Difference]: With dead ends: 2276 [2022-11-02 20:52:26,415 INFO L226 Difference]: Without dead ends: 1195 [2022-11-02 20:52:26,419 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:52:26,420 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 97 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:26,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 192 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-11-02 20:52:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1162. [2022-11-02 20:52:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 1.3807062876830318) internal successors, (1603), 1161 states have internal predecessors, (1603), 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:52:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1603 transitions. [2022-11-02 20:52:26,460 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1603 transitions. Word has length 230 [2022-11-02 20:52:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:26,460 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1603 transitions. [2022-11-02 20:52:26,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:52:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1603 transitions. [2022-11-02 20:52:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-11-02 20:52:26,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:26,465 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 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, 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:52:26,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:52:26,465 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash 77206407, now seen corresponding path program 1 times [2022-11-02 20:52:26,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:26,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175910758] [2022-11-02 20:52:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-02 20:52:26,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:26,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175910758] [2022-11-02 20:52:26,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175910758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:26,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:26,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604740643] [2022-11-02 20:52:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:26,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:26,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:26,580 INFO L87 Difference]: Start difference. First operand 1162 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:52:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:26,754 INFO L93 Difference]: Finished difference Result 2444 states and 3399 transitions. [2022-11-02 20:52:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:26,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 230 [2022-11-02 20:52:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:26,759 INFO L225 Difference]: With dead ends: 2444 [2022-11-02 20:52:26,759 INFO L226 Difference]: Without dead ends: 1291 [2022-11-02 20:52:26,761 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:52:26,761 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:26,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 190 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-11-02 20:52:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1255. [2022-11-02 20:52:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.3835725677830941) internal successors, (1735), 1254 states have internal predecessors, (1735), 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:52:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1735 transitions. [2022-11-02 20:52:26,823 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1735 transitions. Word has length 230 [2022-11-02 20:52:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:26,823 INFO L495 AbstractCegarLoop]: Abstraction has 1255 states and 1735 transitions. [2022-11-02 20:52:26,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:52:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1735 transitions. [2022-11-02 20:52:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-11-02 20:52:26,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:26,828 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 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:52:26,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:52:26,829 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:26,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:26,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1837554521, now seen corresponding path program 1 times [2022-11-02 20:52:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:26,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284431087] [2022-11-02 20:52:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:26,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-11-02 20:52:26,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:26,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284431087] [2022-11-02 20:52:26,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284431087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:26,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:26,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:26,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976911858] [2022-11-02 20:52:26,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:26,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:26,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:26,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:26,946 INFO L87 Difference]: Start difference. First operand 1255 states and 1735 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:52:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:27,134 INFO L93 Difference]: Finished difference Result 2627 states and 3657 transitions. [2022-11-02 20:52:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:27,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:52:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:27,140 INFO L225 Difference]: With dead ends: 2627 [2022-11-02 20:52:27,140 INFO L226 Difference]: Without dead ends: 1393 [2022-11-02 20:52:27,141 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:52:27,142 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 114 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:27,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 173 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2022-11-02 20:52:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1360. [2022-11-02 20:52:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1359 states have (on average 1.3914643119941132) internal successors, (1891), 1359 states have internal predecessors, (1891), 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:52:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1891 transitions. [2022-11-02 20:52:27,185 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1891 transitions. Word has length 260 [2022-11-02 20:52:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:27,186 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1891 transitions. [2022-11-02 20:52:27,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:52:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1891 transitions. [2022-11-02 20:52:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2022-11-02 20:52:27,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:27,191 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 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, 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] [2022-11-02 20:52:27,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:52:27,192 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1040904442, now seen corresponding path program 1 times [2022-11-02 20:52:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:27,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418458715] [2022-11-02 20:52:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:27,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1167 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-11-02 20:52:27,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:27,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418458715] [2022-11-02 20:52:27,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418458715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:27,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:27,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:27,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466581424] [2022-11-02 20:52:27,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:27,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:27,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:27,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:27,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:27,350 INFO L87 Difference]: Start difference. First operand 1360 states and 1891 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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:52:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:27,554 INFO L93 Difference]: Finished difference Result 2723 states and 3783 transitions. [2022-11-02 20:52:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 295 [2022-11-02 20:52:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:27,560 INFO L225 Difference]: With dead ends: 2723 [2022-11-02 20:52:27,560 INFO L226 Difference]: Without dead ends: 1390 [2022-11-02 20:52:27,562 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:52:27,562 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 119 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:27,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2022-11-02 20:52:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1357. [2022-11-02 20:52:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 1.381268436578171) internal successors, (1873), 1356 states have internal predecessors, (1873), 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:52:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1873 transitions. [2022-11-02 20:52:27,611 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1873 transitions. Word has length 295 [2022-11-02 20:52:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:27,612 INFO L495 AbstractCegarLoop]: Abstraction has 1357 states and 1873 transitions. [2022-11-02 20:52:27,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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:52:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1873 transitions. [2022-11-02 20:52:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-11-02 20:52:27,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:27,618 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:52:27,619 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1037565840, now seen corresponding path program 1 times [2022-11-02 20:52:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:27,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611419791] [2022-11-02 20:52:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-11-02 20:52:27,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:27,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611419791] [2022-11-02 20:52:27,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611419791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:27,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:27,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:27,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883463844] [2022-11-02 20:52:27,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:27,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:27,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:27,772 INFO L87 Difference]: Start difference. First operand 1357 states and 1873 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:52:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:27,961 INFO L93 Difference]: Finished difference Result 2705 states and 3732 transitions. [2022-11-02 20:52:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:27,961 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 305 [2022-11-02 20:52:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:27,967 INFO L225 Difference]: With dead ends: 2705 [2022-11-02 20:52:27,967 INFO L226 Difference]: Without dead ends: 1384 [2022-11-02 20:52:27,969 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:52:27,969 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:27,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 245 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-11-02 20:52:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1357. [2022-11-02 20:52:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 1.3613569321533923) internal successors, (1846), 1356 states have internal predecessors, (1846), 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:52:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1846 transitions. [2022-11-02 20:52:28,019 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1846 transitions. Word has length 305 [2022-11-02 20:52:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:28,020 INFO L495 AbstractCegarLoop]: Abstraction has 1357 states and 1846 transitions. [2022-11-02 20:52:28,020 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:52:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1846 transitions. [2022-11-02 20:52:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2022-11-02 20:52:28,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:28,027 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 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, 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] [2022-11-02 20:52:28,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:52:28,027 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1729384344, now seen corresponding path program 1 times [2022-11-02 20:52:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:28,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776080753] [2022-11-02 20:52:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:52:28,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:28,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776080753] [2022-11-02 20:52:28,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776080753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:28,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:28,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381568619] [2022-11-02 20:52:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:28,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:28,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:28,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:28,175 INFO L87 Difference]: Start difference. First operand 1357 states and 1846 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:52:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:28,374 INFO L93 Difference]: Finished difference Result 2828 states and 3822 transitions. [2022-11-02 20:52:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:28,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 332 [2022-11-02 20:52:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:28,380 INFO L225 Difference]: With dead ends: 2828 [2022-11-02 20:52:28,380 INFO L226 Difference]: Without dead ends: 1507 [2022-11-02 20:52:28,382 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:52:28,383 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 127 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:28,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 143 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2022-11-02 20:52:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1402. [2022-11-02 20:52:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.3604568165596003) internal successors, (1906), 1401 states have internal predecessors, (1906), 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:52:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1906 transitions. [2022-11-02 20:52:28,463 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1906 transitions. Word has length 332 [2022-11-02 20:52:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:28,463 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1906 transitions. [2022-11-02 20:52:28,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:52:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1906 transitions. [2022-11-02 20:52:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2022-11-02 20:52:28,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:28,471 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 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, 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] [2022-11-02 20:52:28,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:52:28,471 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1837144220, now seen corresponding path program 1 times [2022-11-02 20:52:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:28,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142163828] [2022-11-02 20:52:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2022-11-02 20:52:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:28,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142163828] [2022-11-02 20:52:28,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142163828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:28,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:28,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889873634] [2022-11-02 20:52:28,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:28,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:28,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:28,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:28,599 INFO L87 Difference]: Start difference. First operand 1402 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:52:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:28,675 INFO L93 Difference]: Finished difference Result 3939 states and 5384 transitions. [2022-11-02 20:52:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:28,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 333 [2022-11-02 20:52:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:28,684 INFO L225 Difference]: With dead ends: 3939 [2022-11-02 20:52:28,685 INFO L226 Difference]: Without dead ends: 2573 [2022-11-02 20:52:28,687 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:52:28,687 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 82 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:28,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 437 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2022-11-02 20:52:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2022-11-02 20:52:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2570 states have (on average 1.367704280155642) internal successors, (3515), 2570 states have internal predecessors, (3515), 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:52:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3515 transitions. [2022-11-02 20:52:28,810 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3515 transitions. Word has length 333 [2022-11-02 20:52:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:28,810 INFO L495 AbstractCegarLoop]: Abstraction has 2571 states and 3515 transitions. [2022-11-02 20:52:28,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:52:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3515 transitions. [2022-11-02 20:52:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2022-11-02 20:52:28,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:28,819 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:28,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:52:28,819 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1564055932, now seen corresponding path program 1 times [2022-11-02 20:52:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:28,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619366880] [2022-11-02 20:52:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-11-02 20:52:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619366880] [2022-11-02 20:52:28,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619366880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280867950] [2022-11-02 20:52:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:28,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:29,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:52:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:29,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:52:29,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-11-02 20:52:29,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-11-02 20:52:29,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280867950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:29,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:29,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:52:29,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510662263] [2022-11-02 20:52:29,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:29,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:29,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:29,512 INFO L87 Difference]: Start difference. First operand 2571 states and 3515 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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:52:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:30,163 INFO L93 Difference]: Finished difference Result 5099 states and 6965 transitions. [2022-11-02 20:52:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:30,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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 343 [2022-11-02 20:52:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:30,177 INFO L225 Difference]: With dead ends: 5099 [2022-11-02 20:52:30,178 INFO L226 Difference]: Without dead ends: 3862 [2022-11-02 20:52:30,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 686 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:52:30,181 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 308 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:30,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 734 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:52:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2022-11-02 20:52:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 2835. [2022-11-02 20:52:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2834 states have (on average 1.3514467184191954) internal successors, (3830), 2834 states have internal predecessors, (3830), 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:52:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3830 transitions. [2022-11-02 20:52:30,331 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3830 transitions. Word has length 343 [2022-11-02 20:52:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:30,332 INFO L495 AbstractCegarLoop]: Abstraction has 2835 states and 3830 transitions. [2022-11-02 20:52:30,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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:52:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3830 transitions. [2022-11-02 20:52:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2022-11-02 20:52:30,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:30,342 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 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, 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] [2022-11-02 20:52:30,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:30,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:52:30,570 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:30,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:30,571 INFO L85 PathProgramCache]: Analyzing trace with hash 61848643, now seen corresponding path program 1 times [2022-11-02 20:52:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:30,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606618215] [2022-11-02 20:52:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:52:30,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:30,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606618215] [2022-11-02 20:52:30,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606618215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:30,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534938758] [2022-11-02 20:52:30,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:30,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:30,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:30,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:30,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:52:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:52:30,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:52:31,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:52:31,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534938758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:31,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:31,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:52:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034387748] [2022-11-02 20:52:31,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:31,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:31,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:31,161 INFO L87 Difference]: Start difference. First operand 2835 states and 3830 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 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:52:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:31,641 INFO L93 Difference]: Finished difference Result 6504 states and 8791 transitions. [2022-11-02 20:52:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:31,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 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 369 [2022-11-02 20:52:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:31,654 INFO L225 Difference]: With dead ends: 6504 [2022-11-02 20:52:31,655 INFO L226 Difference]: Without dead ends: 3698 [2022-11-02 20:52:31,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 737 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:52:31,658 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 231 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:31,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 453 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2022-11-02 20:52:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 2972. [2022-11-02 20:52:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2971 states have (on average 1.3382699427802087) internal successors, (3976), 2971 states have internal predecessors, (3976), 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:52:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 3976 transitions. [2022-11-02 20:52:31,785 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 3976 transitions. Word has length 369 [2022-11-02 20:52:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:31,786 INFO L495 AbstractCegarLoop]: Abstraction has 2972 states and 3976 transitions. [2022-11-02 20:52:31,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 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:52:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 3976 transitions. [2022-11-02 20:52:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-11-02 20:52:31,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:31,797 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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] [2022-11-02 20:52:31,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:32,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:52:32,021 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1613450848, now seen corresponding path program 1 times [2022-11-02 20:52:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:32,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445349279] [2022-11-02 20:52:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-11-02 20:52:32,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:32,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445349279] [2022-11-02 20:52:32,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445349279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:32,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:32,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550392395] [2022-11-02 20:52:32,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:32,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:32,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:32,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:32,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:32,192 INFO L87 Difference]: Start difference. First operand 2972 states and 3976 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:52:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:32,426 INFO L93 Difference]: Finished difference Result 5654 states and 7451 transitions. [2022-11-02 20:52:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 408 [2022-11-02 20:52:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:32,447 INFO L225 Difference]: With dead ends: 5654 [2022-11-02 20:52:32,454 INFO L226 Difference]: Without dead ends: 1598 [2022-11-02 20:52:32,457 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:52:32,458 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 39 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:32,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 252 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2022-11-02 20:52:32,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1532. [2022-11-02 20:52:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.3383409536250817) internal successors, (2049), 1531 states have internal predecessors, (2049), 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:52:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2049 transitions. [2022-11-02 20:52:32,528 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2049 transitions. Word has length 408 [2022-11-02 20:52:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:32,528 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 2049 transitions. [2022-11-02 20:52:32,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:52:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2049 transitions. [2022-11-02 20:52:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2022-11-02 20:52:32,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:32,534 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 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, 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] [2022-11-02 20:52:32,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:52:32,534 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1952423320, now seen corresponding path program 1 times [2022-11-02 20:52:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:32,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933551372] [2022-11-02 20:52:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2022-11-02 20:52:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:32,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933551372] [2022-11-02 20:52:32,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933551372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:32,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168036868] [2022-11-02 20:52:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:32,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:32,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:32,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:32,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:52:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:32,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:52:32,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2022-11-02 20:52:33,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:52:33,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168036868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:33,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:52:33,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:52:33,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642418890] [2022-11-02 20:52:33,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:33,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:33,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:33,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:33,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:33,516 INFO L87 Difference]: Start difference. First operand 1532 states and 2049 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:52:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:33,560 INFO L93 Difference]: Finished difference Result 1557 states and 2079 transitions. [2022-11-02 20:52:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 492 [2022-11-02 20:52:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:33,564 INFO L225 Difference]: With dead ends: 1557 [2022-11-02 20:52:33,564 INFO L226 Difference]: Without dead ends: 1308 [2022-11-02 20:52:33,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 492 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:52:33,566 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:33,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2022-11-02 20:52:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1285. [2022-11-02 20:52:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.337227414330218) internal successors, (1717), 1284 states have internal predecessors, (1717), 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:52:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1717 transitions. [2022-11-02 20:52:33,620 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1717 transitions. Word has length 492 [2022-11-02 20:52:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:33,621 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1717 transitions. [2022-11-02 20:52:33,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:52:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1717 transitions. [2022-11-02 20:52:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-11-02 20:52:33,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:33,626 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 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, 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:52:33,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:33,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:33,843 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:33,843 INFO L85 PathProgramCache]: Analyzing trace with hash 68555604, now seen corresponding path program 1 times [2022-11-02 20:52:33,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:33,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939534962] [2022-11-02 20:52:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1545 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2022-11-02 20:52:34,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939534962] [2022-11-02 20:52:34,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939534962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263641063] [2022-11-02 20:52:34,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:34,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:34,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:34,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:34,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:52:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:34,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:52:34,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2338 trivial. 0 not checked. [2022-11-02 20:52:34,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:52:34,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263641063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:34,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:52:34,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:52:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668346673] [2022-11-02 20:52:34,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:34,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:34,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:34,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:34,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:34,320 INFO L87 Difference]: Start difference. First operand 1285 states and 1717 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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:52:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:34,492 INFO L93 Difference]: Finished difference Result 2642 states and 3546 transitions. [2022-11-02 20:52:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 494 [2022-11-02 20:52:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:34,497 INFO L225 Difference]: With dead ends: 2642 [2022-11-02 20:52:34,497 INFO L226 Difference]: Without dead ends: 1393 [2022-11-02 20:52:34,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 494 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:52:34,499 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 49 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:34,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2022-11-02 20:52:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1390. [2022-11-02 20:52:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.2966162706983442) internal successors, (1801), 1389 states have internal predecessors, (1801), 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:52:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1801 transitions. [2022-11-02 20:52:34,561 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1801 transitions. Word has length 494 [2022-11-02 20:52:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:34,562 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1801 transitions. [2022-11-02 20:52:34,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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:52:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1801 transitions. [2022-11-02 20:52:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2022-11-02 20:52:34,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:34,568 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:52:34,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:34,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:34,790 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1158579758, now seen corresponding path program 2 times [2022-11-02 20:52:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:34,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218355608] [2022-11-02 20:52:34,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-11-02 20:52:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:35,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218355608] [2022-11-02 20:52:35,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218355608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:35,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777440391] [2022-11-02 20:52:35,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:52:35,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:35,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:35,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:35,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:52:35,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:52:35,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:52:35,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:52:35,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-11-02 20:52:35,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-11-02 20:52:35,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777440391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:35,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:35,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-02 20:52:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739264691] [2022-11-02 20:52:35,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:35,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:52:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:35,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:52:35,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:35,474 INFO L87 Difference]: Start difference. First operand 1390 states and 1801 transitions. Second operand has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:35,732 INFO L93 Difference]: Finished difference Result 1624 states and 2097 transitions. [2022-11-02 20:52:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:35,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 604 [2022-11-02 20:52:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:35,733 INFO L225 Difference]: With dead ends: 1624 [2022-11-02 20:52:35,733 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:52:35,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 1206 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:52:35,735 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 120 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:35,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 335 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:52:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:52:35,738 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:52:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:52:35,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 604 [2022-11-02 20:52:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:35,739 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:52:35,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:52:35,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:52:35,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:52:35,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:35,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:35,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:52:39,001 INFO L902 garLoopResultBuilder]: At program point L630(lines 622 632) the Hoare annotation is: true [2022-11-02 20:52:39,002 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-11-02 20:52:39,002 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 239) no Hoare annotation was computed. [2022-11-02 20:52:39,002 INFO L899 garLoopResultBuilder]: For program point L499(lines 499 504) no Hoare annotation was computed. [2022-11-02 20:52:39,002 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 477) no Hoare annotation was computed. [2022-11-02 20:52:39,002 INFO L899 garLoopResultBuilder]: For program point L466-1(lines 466 477) no Hoare annotation was computed. [2022-11-02 20:52:39,002 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 545) no Hoare annotation was computed. [2022-11-02 20:52:39,002 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 556) no Hoare annotation was computed. [2022-11-02 20:52:39,002 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 567) no Hoare annotation was computed. [2022-11-02 20:52:39,003 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 405) no Hoare annotation was computed. [2022-11-02 20:52:39,003 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-11-02 20:52:39,003 INFO L899 garLoopResultBuilder]: For program point L335-2(lines 210 540) no Hoare annotation was computed. [2022-11-02 20:52:39,003 INFO L895 garLoopResultBuilder]: At program point L203(lines 202 545) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.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 (<= 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|) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 (not .cse0) .cse2))) [2022-11-02 20:52:39,003 INFO L895 garLoopResultBuilder]: At program point L170(lines 160 559) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:52:39,003 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 474) no Hoare annotation was computed. [2022-11-02 20:52:39,004 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 274) no Hoare annotation was computed. [2022-11-02 20:52:39,004 INFO L899 garLoopResultBuilder]: For program point L270-2(lines 210 540) no Hoare annotation was computed. [2022-11-02 20:52:39,004 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 544) no Hoare annotation was computed. [2022-11-02 20:52:39,004 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 555) no Hoare annotation was computed. [2022-11-02 20:52:39,004 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 566) no Hoare annotation was computed. [2022-11-02 20:52:39,004 INFO L895 garLoopResultBuilder]: At program point L106-1(lines 72 620) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse11 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse10 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse12 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse13 (not .cse0)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5 .cse6) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse0 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse10 .cse6) (and .cse3 .cse8) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse11) (and .cse0 .cse3 .cse2 .cse12) (and (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse7 .cse9 .cse13 .cse10) (and .cse0 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse0 .cse7 .cse12) (and .cse7 .cse4 .cse13 .cse5) (and .cse7 (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse1)))) [2022-11-02 20:52:39,004 INFO L899 garLoopResultBuilder]: For program point L305(lines 305 309) no Hoare annotation was computed. [2022-11-02 20:52:39,005 INFO L899 garLoopResultBuilder]: For program point L305-2(lines 305 309) no Hoare annotation was computed. [2022-11-02 20:52:39,005 INFO L902 garLoopResultBuilder]: At program point L206(lines 205 544) the Hoare annotation is: true [2022-11-02 20:52:39,005 INFO L895 garLoopResultBuilder]: At program point L140(lines 136 567) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse2 (< 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2) (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)))) [2022-11-02 20:52:39,005 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-11-02 20:52:39,005 INFO L899 garLoopResultBuilder]: For program point L438(lines 438 442) no Hoare annotation was computed. [2022-11-02 20:52:39,005 INFO L899 garLoopResultBuilder]: For program point L438-2(lines 210 540) no Hoare annotation was computed. [2022-11-02 20:52:39,005 INFO L899 garLoopResultBuilder]: For program point L240(lines 240 245) no Hoare annotation was computed. [2022-11-02 20:52:39,005 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2022-11-02 20:52:39,005 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 554) no Hoare annotation was computed. [2022-11-02 20:52:39,006 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 565) no Hoare annotation was computed. [2022-11-02 20:52:39,006 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 576) no Hoare annotation was computed. [2022-11-02 20:52:39,006 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-11-02 20:52:39,006 INFO L899 garLoopResultBuilder]: For program point L407-2(lines 407 412) no Hoare annotation was computed. [2022-11-02 20:52:39,006 INFO L902 garLoopResultBuilder]: At program point L209(lines 208 543) the Hoare annotation is: true [2022-11-02 20:52:39,006 INFO L895 garLoopResultBuilder]: At program point L176(lines 172 555) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-11-02 20:52:39,006 INFO L895 garLoopResultBuilder]: At program point L110(lines 109 576) the Hoare annotation is: (and (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-11-02 20:52:39,007 INFO L895 garLoopResultBuilder]: At program point L541(lines 106 607) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse10 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse11 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse12 (not .cse0)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5 .cse6) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse0 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse10 .cse6) (and .cse3 .cse8) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse0 .cse3 .cse2 .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse7 .cse9 .cse12 .cse10) (and .cse0 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse0 .cse7 .cse11) (and .cse7 .cse4 .cse12 .cse5) (and .cse7 (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse1)))) [2022-11-02 20:52:39,007 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 553) no Hoare annotation was computed. [2022-11-02 20:52:39,007 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 564) no Hoare annotation was computed. [2022-11-02 20:52:39,007 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 575) no Hoare annotation was computed. [2022-11-02 20:52:39,007 INFO L902 garLoopResultBuilder]: At program point L608(lines 105 609) the Hoare annotation is: true [2022-11-02 20:52:39,007 INFO L895 garLoopResultBuilder]: At program point L146(lines 142 565) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |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:52:39,007 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L378-2(lines 378 382) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 605) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 552) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 563) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 574) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L578(lines 578 602) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L512-1(lines 210 540) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 352) no Hoare annotation was computed. [2022-11-02 20:52:39,008 INFO L899 garLoopResultBuilder]: For program point L314-1(lines 314 328) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L895 garLoopResultBuilder]: At program point L215(lines 112 575) the Hoare annotation is: (and (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-11-02 20:52:39,009 INFO L895 garLoopResultBuilder]: At program point L182(lines 178 553) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L612(lines 612 616) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 588) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L612-2(lines 612 616) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L579-2(lines 578 600) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 551) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 562) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 573) no Hoare annotation was computed. [2022-11-02 20:52:39,009 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2022-11-02 20:52:39,010 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 454) no Hoare annotation was computed. [2022-11-02 20:52:39,010 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:52:39,011 INFO L895 garLoopResultBuilder]: At program point L152(lines 148 563) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:52:39,011 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 94) no Hoare annotation was computed. [2022-11-02 20:52:39,011 INFO L899 garLoopResultBuilder]: For program point L483(lines 483 487) no Hoare annotation was computed. [2022-11-02 20:52:39,012 INFO L899 garLoopResultBuilder]: For program point L318(lines 318 322) no Hoare annotation was computed. [2022-11-02 20:52:39,012 INFO L899 garLoopResultBuilder]: For program point L318-2(lines 316 328) no Hoare annotation was computed. [2022-11-02 20:52:39,012 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 517 521) no Hoare annotation was computed. [2022-11-02 20:52:39,012 INFO L899 garLoopResultBuilder]: For program point L418(lines 418 422) no Hoare annotation was computed. [2022-11-02 20:52:39,012 INFO L899 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2022-11-02 20:52:39,012 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 550) no Hoare annotation was computed. [2022-11-02 20:52:39,013 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 561) no Hoare annotation was computed. [2022-11-02 20:52:39,013 INFO L899 garLoopResultBuilder]: For program point L220-2(lines 210 540) no Hoare annotation was computed. [2022-11-02 20:52:39,013 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 572) no Hoare annotation was computed. [2022-11-02 20:52:39,013 INFO L895 garLoopResultBuilder]: At program point L188(lines 184 551) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0))) [2022-11-02 20:52:39,014 INFO L899 garLoopResultBuilder]: For program point L89(lines 89 93) no Hoare annotation was computed. [2022-11-02 20:52:39,014 INFO L899 garLoopResultBuilder]: For program point L89-2(lines 86 94) no Hoare annotation was computed. [2022-11-02 20:52:39,014 INFO L902 garLoopResultBuilder]: At program point L619(lines 19 621) the Hoare annotation is: true [2022-11-02 20:52:39,014 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:52:39,014 INFO L899 garLoopResultBuilder]: For program point L256(lines 256 261) no Hoare annotation was computed. [2022-11-02 20:52:39,014 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 549) no Hoare annotation was computed. [2022-11-02 20:52:39,014 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 560) no Hoare annotation was computed. [2022-11-02 20:52:39,015 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 571) no Hoare annotation was computed. [2022-11-02 20:52:39,015 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-11-02 20:52:39,015 INFO L899 garLoopResultBuilder]: For program point L488-2(lines 488 492) no Hoare annotation was computed. [2022-11-02 20:52:39,015 INFO L895 garLoopResultBuilder]: At program point L158(lines 154 561) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:52:39,015 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-11-02 20:52:39,016 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-11-02 20:52:39,016 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2022-11-02 20:52:39,016 INFO L895 garLoopResultBuilder]: At program point L358(lines 72 620) the Hoare annotation is: false [2022-11-02 20:52:39,016 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 548) no Hoare annotation was computed. [2022-11-02 20:52:39,016 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 559) no Hoare annotation was computed. [2022-11-02 20:52:39,016 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 570) no Hoare annotation was computed. [2022-11-02 20:52:39,016 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:52:39,017 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 596) no Hoare annotation was computed. [2022-11-02 20:52:39,017 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 528) no Hoare annotation was computed. [2022-11-02 20:52:39,017 INFO L899 garLoopResultBuilder]: For program point L524-2(lines 524 528) no Hoare annotation was computed. [2022-11-02 20:52:39,017 INFO L895 garLoopResultBuilder]: At program point L194(lines 190 549) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse2) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2))) [2022-11-02 20:52:39,017 INFO L895 garLoopResultBuilder]: At program point L128(lines 124 571) the Hoare annotation is: (and (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-11-02 20:52:39,018 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 463) no Hoare annotation was computed. [2022-11-02 20:52:39,018 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 298) no Hoare annotation was computed. [2022-11-02 20:52:39,018 INFO L899 garLoopResultBuilder]: For program point L294-2(lines 210 540) no Hoare annotation was computed. [2022-11-02 20:52:39,018 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 104) no Hoare annotation was computed. [2022-11-02 20:52:39,018 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 547) no Hoare annotation was computed. [2022-11-02 20:52:39,018 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 558) no Hoare annotation was computed. [2022-11-02 20:52:39,019 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 569) no Hoare annotation was computed. [2022-11-02 20:52:39,019 INFO L899 garLoopResultBuilder]: For program point L97(lines 97 101) no Hoare annotation was computed. [2022-11-02 20:52:39,019 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2022-11-02 20:52:39,019 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:52:39,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2022-11-02 20:52:39,019 INFO L899 garLoopResultBuilder]: For program point L496-1(lines 496 508) no Hoare annotation was computed. [2022-11-02 20:52:39,020 INFO L899 garLoopResultBuilder]: For program point L430(lines 430 434) no Hoare annotation was computed. [2022-11-02 20:52:39,020 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 249) no Hoare annotation was computed. [2022-11-02 20:52:39,020 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 546) no Hoare annotation was computed. [2022-11-02 20:52:39,020 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 557) no Hoare annotation was computed. [2022-11-02 20:52:39,020 INFO L899 garLoopResultBuilder]: For program point L232-2(lines 210 540) no Hoare annotation was computed. [2022-11-02 20:52:39,020 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 568) no Hoare annotation was computed. [2022-11-02 20:52:39,021 INFO L895 garLoopResultBuilder]: At program point L200(lines 196 547) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= 4560 |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 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 (not .cse0) .cse2))) [2022-11-02 20:52:39,021 INFO L895 garLoopResultBuilder]: At program point L134(lines 130 569) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) [2022-11-02 20:52:39,024 INFO L444 BasicCegarLoop]: Path program histogram: [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] [2022-11-02 20:52:39,026 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:52:39,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:52:39 BoogieIcfgContainer [2022-11-02 20:52:39,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:52:39,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:52:39,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:52:39,050 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:52:39,050 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:22" (3/4) ... [2022-11-02 20:52:39,053 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:52:39,067 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-02 20:52:39,068 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:52:39,069 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:52:39,069 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:52:39,158 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:52:39,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:52:39,159 INFO L158 Benchmark]: Toolchain (without parser) took 18607.51ms. Allocated memory was 98.6MB in the beginning and 333.4MB in the end (delta: 234.9MB). Free memory was 56.3MB in the beginning and 178.9MB in the end (delta: -122.6MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2022-11-02 20:52:39,160 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 98.6MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:52:39,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.42ms. Allocated memory is still 98.6MB. Free memory was 56.1MB in the beginning and 69.2MB in the end (delta: -13.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:52:39,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.50ms. Allocated memory is still 98.6MB. Free memory was 69.2MB in the beginning and 66.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:52:39,160 INFO L158 Benchmark]: Boogie Preprocessor took 34.13ms. Allocated memory is still 98.6MB. Free memory was 66.3MB in the beginning and 64.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:52:39,161 INFO L158 Benchmark]: RCFGBuilder took 975.96ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 64.2MB in the beginning and 110.1MB in the end (delta: -45.9MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2022-11-02 20:52:39,161 INFO L158 Benchmark]: TraceAbstraction took 17012.24ms. Allocated memory was 136.3MB in the beginning and 333.4MB in the end (delta: 197.1MB). Free memory was 109.4MB in the beginning and 186.2MB in the end (delta: -76.8MB). Peak memory consumption was 207.1MB. Max. memory is 16.1GB. [2022-11-02 20:52:39,162 INFO L158 Benchmark]: Witness Printer took 109.61ms. Allocated memory is still 333.4MB. Free memory was 186.2MB in the beginning and 178.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:52:39,163 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 98.6MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.42ms. Allocated memory is still 98.6MB. Free memory was 56.1MB in the beginning and 69.2MB in the end (delta: -13.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.50ms. Allocated memory is still 98.6MB. Free memory was 69.2MB in the beginning and 66.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.13ms. Allocated memory is still 98.6MB. Free memory was 66.3MB in the beginning and 64.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 975.96ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 64.2MB in the beginning and 110.1MB in the end (delta: -45.9MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17012.24ms. Allocated memory was 136.3MB in the beginning and 333.4MB in the end (delta: 197.1MB). Free memory was 109.4MB in the beginning and 186.2MB in the end (delta: -76.8MB). Peak memory consumption was 207.1MB. Max. memory is 16.1GB. * Witness Printer took 109.61ms. Allocated memory is still 333.4MB. Free memory was 186.2MB in the beginning and 178.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: 618]: 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, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 26, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2186 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2186 mSDsluCounter, 7195 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2775 mSDsCounter, 665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2898 IncrementalHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 665 mSolverCounterUnsat, 4420 mSDtfsCounter, 2898 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3703 GetRequests, 3657 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2972occurred in iteration=22, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 2241 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 140 NumberOfFragments, 584 HoareAnnotationTreeSize, 23 FomulaSimplifications, 4773 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 23 FomulaSimplificationsInter, 4702 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 8290 NumberOfCodeBlocks, 8290 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 9572 ConstructedInterpolants, 0 QuantifiedInterpolants, 12806 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3863 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 43484/43605 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: 12292 == s__state && blastFlag == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (!(4400 <= s__state) && blastFlag == 1) && 4352 <= s__state - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((s__hit == 0 && s__state <= 4432) && 4384 < s__state) && blastFlag <= 4 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (s__state < 4400 && 4352 <= s__state) && blastFlag == 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((s__hit == 0 && s__state <= 4432) && 2 == blastFlag) && 4384 < s__state) || ((((s__hit == 0 && s__state <= 4432) && s__s3__tmp__next_state___0 <= 4560) && 4384 < s__state) && blastFlag <= 4) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || (4368 == s__state && blastFlag == 0)) || (((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4400 == s__state)) || (12292 == s__state && blastFlag == 0)) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state)) || ((s__hit == 0 && 4416 == s__state) && blastFlag <= 4)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) || (((4432 <= s__state && s__hit == 0) && s__state <= 4560) && blastFlag <= 4)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4560) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || (4368 == s__state && blastFlag == 0)) || (((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4400 == s__state)) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state)) || ((s__hit == 0 && 4416 == s__state) && blastFlag <= 4)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4448) && blastFlag <= 4 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: s__state <= 4352 && blastFlag == 0 - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4464) && blastFlag <= 4 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4480) && blastFlag <= 4 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:52:39,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5716ea50-a6fa-4038-9444-73d8222a4e4d/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