./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:48:31,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:48:31,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:48:31,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:48:31,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:48:31,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:48:31,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:48:31,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:48:31,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:48:31,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:48:31,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:48:31,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:48:31,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:48:31,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:48:31,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:48:31,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:48:31,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:48:31,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:48:31,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:48:31,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:48:31,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:48:31,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:48:31,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:48:31,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:48:31,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:48:31,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:48:31,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:48:31,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:48:31,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:48:31,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:48:31,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:48:31,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:48:31,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:48:31,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:48:31,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:48:31,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:48:31,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:48:31,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:48:31,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:48:31,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:48:31,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:48:31,214 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:48:31,260 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:48:31,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:48:31,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:48:31,262 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:48:31,262 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:48:31,262 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:48:31,263 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:48:31,263 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:48:31,263 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:48:31,264 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:48:31,265 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:48:31,265 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:48:31,265 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:48:31,266 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:48:31,266 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:48:31,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:48:31,267 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:48:31,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:48:31,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:48:31,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:48:31,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:48:31,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:48:31,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:48:31,269 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:48:31,269 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:48:31,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:48:31,269 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:48:31,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:48:31,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:48:31,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:48:31,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:48:31,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:48:31,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:48:31,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:48:31,273 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:48:31,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:48:31,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:48:31,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:48:31,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:48:31,274 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/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_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8 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 -> Taipan 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 -> bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec [2021-11-07 01:48:31,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:48:31,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:48:31,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:48:31,606 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:48:31,607 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:48:31,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-11-07 01:48:31,700 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/data/a1c9197a8/8597fc549a524c94b79d616ca0ea3151/FLAGf619f1175 [2021-11-07 01:48:32,219 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:48:32,220 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-11-07 01:48:32,235 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/data/a1c9197a8/8597fc549a524c94b79d616ca0ea3151/FLAGf619f1175 [2021-11-07 01:48:32,573 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/data/a1c9197a8/8597fc549a524c94b79d616ca0ea3151 [2021-11-07 01:48:32,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:48:32,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:48:32,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:48:32,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:48:32,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:48:32,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:32" (1/1) ... [2021-11-07 01:48:32,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5daf47d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:32, skipping insertion in model container [2021-11-07 01:48:32,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:32" (1/1) ... [2021-11-07 01:48:32,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:48:32,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:48:32,915 WARN L228 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_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-11-07 01:48:32,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:48:32,928 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:48:33,004 WARN L228 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_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-11-07 01:48:33,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:48:33,021 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:48:33,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33 WrapperNode [2021-11-07 01:48:33,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:48:33,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:48:33,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:48:33,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:48:33,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:48:33,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:48:33,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:48:33,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:48:33,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:48:33,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:48:33,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:48:33,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:48:33,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (1/1) ... [2021-11-07 01:48:33,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:48:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:48:33,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:48:33,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:48:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:48:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:48:33,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:48:33,596 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,606 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,632 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,642 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,651 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,656 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,665 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,668 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,671 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,674 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,676 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:33,695 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:48:34,635 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-11-07 01:48:34,636 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-11-07 01:48:34,636 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-11-07 01:48:34,636 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-11-07 01:48:34,636 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2021-11-07 01:48:34,636 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2021-11-07 01:48:34,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-11-07 01:48:34,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-11-07 01:48:34,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2021-11-07 01:48:34,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2021-11-07 01:48:34,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-11-07 01:48:34,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-11-07 01:48:34,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-11-07 01:48:34,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-11-07 01:48:34,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2021-11-07 01:48:34,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2021-11-07 01:48:34,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2021-11-07 01:48:34,639 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2021-11-07 01:48:34,639 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2021-11-07 01:48:34,639 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2021-11-07 01:48:34,639 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-11-07 01:48:34,640 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-11-07 01:48:34,640 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2021-11-07 01:48:34,640 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2021-11-07 01:48:35,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:48:35,469 INFO L299 CfgBuilder]: Removed 152 assume(true) statements. [2021-11-07 01:48:35,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:35 BoogieIcfgContainer [2021-11-07 01:48:35,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:48:35,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:48:35,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:48:35,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:48:35,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:48:32" (1/3) ... [2021-11-07 01:48:35,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a252f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:35, skipping insertion in model container [2021-11-07 01:48:35,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:33" (2/3) ... [2021-11-07 01:48:35,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a252f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:35, skipping insertion in model container [2021-11-07 01:48:35,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:35" (3/3) ... [2021-11-07 01:48:35,482 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2021-11-07 01:48:35,488 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:48:35,488 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-11-07 01:48:35,542 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:48:35,549 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:48:35,549 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-11-07 01:48:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 168 states have (on average 1.7797619047619047) internal successors, (299), 197 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:48:35,576 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:35,576 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:35,577 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash -596333414, now seen corresponding path program 1 times [2021-11-07 01:48:35,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:35,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565649448] [2021-11-07 01:48:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:35,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:35,816 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:35,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565649448] [2021-11-07 01:48:35,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565649448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:35,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:35,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:35,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448163309] [2021-11-07 01:48:35,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:35,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:35,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:35,844 INFO L87 Difference]: Start difference. First operand has 198 states, 168 states have (on average 1.7797619047619047) internal successors, (299), 197 states have internal predecessors, (299), 0 states have call successors, (0), 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:36,028 INFO L93 Difference]: Finished difference Result 349 states and 520 transitions. [2021-11-07 01:48:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:36,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-11-07 01:48:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:36,044 INFO L225 Difference]: With dead ends: 349 [2021-11-07 01:48:36,044 INFO L226 Difference]: Without dead ends: 180 [2021-11-07 01:48:36,048 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:36,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-07 01:48:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-11-07 01:48:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.4968944099378882) internal successors, (241), 179 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 241 transitions. [2021-11-07 01:48:36,103 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 241 transitions. Word has length 9 [2021-11-07 01:48:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:36,104 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 241 transitions. [2021-11-07 01:48:36,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 241 transitions. [2021-11-07 01:48:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:48:36,106 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:36,107 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:36,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:48:36,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:36,109 INFO L85 PathProgramCache]: Analyzing trace with hash -125871233, now seen corresponding path program 1 times [2021-11-07 01:48:36,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:36,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239852176] [2021-11-07 01:48:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:36,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:36,167 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:36,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239852176] [2021-11-07 01:48:36,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239852176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:36,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:36,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:36,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359708504] [2021-11-07 01:48:36,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:36,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:36,172 INFO L87 Difference]: Start difference. First operand 180 states and 241 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:36,216 INFO L93 Difference]: Finished difference Result 276 states and 361 transitions. [2021-11-07 01:48:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:36,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-07 01:48:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:36,219 INFO L225 Difference]: With dead ends: 276 [2021-11-07 01:48:36,219 INFO L226 Difference]: Without dead ends: 182 [2021-11-07 01:48:36,221 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-07 01:48:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2021-11-07 01:48:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 139 states have (on average 1.4172661870503598) internal successors, (197), 149 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2021-11-07 01:48:36,238 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 10 [2021-11-07 01:48:36,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:36,238 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2021-11-07 01:48:36,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2021-11-07 01:48:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:48:36,240 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:36,240 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:36,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:48:36,241 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:36,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash 895831734, now seen corresponding path program 1 times [2021-11-07 01:48:36,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:36,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781490154] [2021-11-07 01:48:36,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:36,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:36,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:36,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781490154] [2021-11-07 01:48:36,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781490154] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:36,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:36,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:48:36,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205652435] [2021-11-07 01:48:36,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:36,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:36,297 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:36,321 INFO L93 Difference]: Finished difference Result 163 states and 213 transitions. [2021-11-07 01:48:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:36,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-07 01:48:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:36,325 INFO L225 Difference]: With dead ends: 163 [2021-11-07 01:48:36,325 INFO L226 Difference]: Without dead ends: 150 [2021-11-07 01:48:36,327 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-07 01:48:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-11-07 01:48:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 139 states have (on average 1.410071942446043) internal successors, (196), 149 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 196 transitions. [2021-11-07 01:48:36,357 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 196 transitions. Word has length 10 [2021-11-07 01:48:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:36,358 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 196 transitions. [2021-11-07 01:48:36,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2021-11-07 01:48:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:48:36,365 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:36,366 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:36,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:48:36,367 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1805126309, now seen corresponding path program 1 times [2021-11-07 01:48:36,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:36,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095214458] [2021-11-07 01:48:36,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:36,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:36,471 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:36,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095214458] [2021-11-07 01:48:36,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095214458] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:36,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:36,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:36,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427769433] [2021-11-07 01:48:36,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:36,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:36,476 INFO L87 Difference]: Start difference. First operand 150 states and 196 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:36,575 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2021-11-07 01:48:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-07 01:48:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:36,577 INFO L225 Difference]: With dead ends: 150 [2021-11-07 01:48:36,577 INFO L226 Difference]: Without dead ends: 136 [2021-11-07 01:48:36,579 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-07 01:48:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-11-07 01:48:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.378787878787879) internal successors, (182), 135 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2021-11-07 01:48:36,607 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 15 [2021-11-07 01:48:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:36,612 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2021-11-07 01:48:36,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2021-11-07 01:48:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:48:36,616 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:36,616 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:36,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:48:36,617 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash 345633206, now seen corresponding path program 1 times [2021-11-07 01:48:36,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:36,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130638753] [2021-11-07 01:48:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:36,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:36,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:36,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130638753] [2021-11-07 01:48:36,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130638753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:36,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:36,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:36,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673120054] [2021-11-07 01:48:36,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:36,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:36,697 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:36,766 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2021-11-07 01:48:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:36,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-11-07 01:48:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:36,768 INFO L225 Difference]: With dead ends: 166 [2021-11-07 01:48:36,768 INFO L226 Difference]: Without dead ends: 133 [2021-11-07 01:48:36,769 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-07 01:48:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-11-07 01:48:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 132 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions. [2021-11-07 01:48:36,777 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 18 [2021-11-07 01:48:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:36,778 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 178 transitions. [2021-11-07 01:48:36,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2021-11-07 01:48:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:48:36,779 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:36,779 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:36,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:48:36,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1337949913, now seen corresponding path program 1 times [2021-11-07 01:48:36,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:36,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974064639] [2021-11-07 01:48:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:36,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:36,829 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:36,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974064639] [2021-11-07 01:48:36,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974064639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:36,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:36,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:36,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604238242] [2021-11-07 01:48:36,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:36,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:36,831 INFO L87 Difference]: Start difference. First operand 133 states and 178 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:36,851 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2021-11-07 01:48:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:36,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-11-07 01:48:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:36,853 INFO L225 Difference]: With dead ends: 179 [2021-11-07 01:48:36,854 INFO L226 Difference]: Without dead ends: 147 [2021-11-07 01:48:36,854 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-07 01:48:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2021-11-07 01:48:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 132 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2021-11-07 01:48:36,862 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 18 [2021-11-07 01:48:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:36,863 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2021-11-07 01:48:36,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2021-11-07 01:48:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 01:48:36,864 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:36,864 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:36,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:48:36,865 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash -947103727, now seen corresponding path program 1 times [2021-11-07 01:48:36,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:36,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731269329] [2021-11-07 01:48:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:36,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:36,913 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:36,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731269329] [2021-11-07 01:48:36,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731269329] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:36,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:36,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:36,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643494516] [2021-11-07 01:48:36,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:36,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:36,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:36,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:36,916 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:36,934 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2021-11-07 01:48:36,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:36,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-11-07 01:48:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:36,936 INFO L225 Difference]: With dead ends: 177 [2021-11-07 01:48:36,936 INFO L226 Difference]: Without dead ends: 145 [2021-11-07 01:48:36,937 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-07 01:48:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2021-11-07 01:48:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.359375) internal successors, (174), 130 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2021-11-07 01:48:36,945 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 19 [2021-11-07 01:48:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:36,945 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2021-11-07 01:48:36,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2021-11-07 01:48:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 01:48:36,947 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:36,947 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:36,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:48:36,947 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2134817482, now seen corresponding path program 1 times [2021-11-07 01:48:36,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:36,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541941384] [2021-11-07 01:48:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:36,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:36,993 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:36,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541941384] [2021-11-07 01:48:36,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541941384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:36,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:36,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:36,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229556115] [2021-11-07 01:48:36,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:48:36,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:36,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:48:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:48:36,996 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:37,099 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2021-11-07 01:48:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:48:37,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-07 01:48:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:37,101 INFO L225 Difference]: With dead ends: 161 [2021-11-07 01:48:37,101 INFO L226 Difference]: Without dead ends: 131 [2021-11-07 01:48:37,101 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:48:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-07 01:48:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-11-07 01:48:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.3515625) internal successors, (173), 130 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2021-11-07 01:48:37,111 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 20 [2021-11-07 01:48:37,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:37,111 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2021-11-07 01:48:37,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2021-11-07 01:48:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:48:37,112 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:37,113 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:37,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:48:37,113 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash 533053490, now seen corresponding path program 1 times [2021-11-07 01:48:37,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:37,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771587841] [2021-11-07 01:48:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:37,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:37,145 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:37,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771587841] [2021-11-07 01:48:37,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771587841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:37,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:37,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:37,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695487401] [2021-11-07 01:48:37,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:37,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:37,147 INFO L87 Difference]: Start difference. First operand 131 states and 173 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:37,164 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2021-11-07 01:48:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:37,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-11-07 01:48:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:37,166 INFO L225 Difference]: With dead ends: 138 [2021-11-07 01:48:37,166 INFO L226 Difference]: Without dead ends: 29 [2021-11-07 01:48:37,166 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-07 01:48:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-07 01:48:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-11-07 01:48:37,170 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2021-11-07 01:48:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:37,170 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-11-07 01:48:37,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-11-07 01:48:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:48:37,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:37,171 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:37,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:48:37,172 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1946876568, now seen corresponding path program 1 times [2021-11-07 01:48:37,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:37,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306223393] [2021-11-07 01:48:37,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:37,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:37,272 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:37,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306223393] [2021-11-07 01:48:37,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306223393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:37,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:37,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:48:37,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809409215] [2021-11-07 01:48:37,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:48:37,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:37,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:48:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:48:37,274 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:37,319 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2021-11-07 01:48:37,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:48:37,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-11-07 01:48:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:37,321 INFO L225 Difference]: With dead ends: 33 [2021-11-07 01:48:37,321 INFO L226 Difference]: Without dead ends: 29 [2021-11-07 01:48:37,321 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:48:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-07 01:48:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-07 01:48:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2021-11-07 01:48:37,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2021-11-07 01:48:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:37,325 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2021-11-07 01:48:37,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2021-11-07 01:48:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:48:37,326 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:37,326 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:37,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:48:37,327 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash 158373879, now seen corresponding path program 1 times [2021-11-07 01:48:37,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:37,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783975473] [2021-11-07 01:48:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:37,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:37,369 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:37,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783975473] [2021-11-07 01:48:37,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783975473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:37,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:37,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:37,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068651769] [2021-11-07 01:48:37,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:37,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:37,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:37,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:37,372 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:37,387 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2021-11-07 01:48:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:37,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-11-07 01:48:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:37,389 INFO L225 Difference]: With dead ends: 33 [2021-11-07 01:48:37,389 INFO L226 Difference]: Without dead ends: 31 [2021-11-07 01:48:37,389 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-11-07 01:48:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-11-07 01:48:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2021-11-07 01:48:37,393 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 22 [2021-11-07 01:48:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:37,394 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2021-11-07 01:48:37,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2021-11-07 01:48:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:48:37,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:37,395 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:48:37,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:48:37,395 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash 606964236, now seen corresponding path program 1 times [2021-11-07 01:48:37,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:37,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627910804] [2021-11-07 01:48:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:37,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:37,440 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:37,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627910804] [2021-11-07 01:48:37,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627910804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:37,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:37,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:48:37,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761813915] [2021-11-07 01:48:37,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:48:37,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:37,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:48:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:48:37,443 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:37,453 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2021-11-07 01:48:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:48:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-11-07 01:48:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:37,454 INFO L225 Difference]: With dead ends: 36 [2021-11-07 01:48:37,454 INFO L226 Difference]: Without dead ends: 26 [2021-11-07 01:48:37,455 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:48:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-07 01:48:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-07 01:48:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2021-11-07 01:48:37,458 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 23 [2021-11-07 01:48:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:37,459 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2021-11-07 01:48:37,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2021-11-07 01:48:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:48:37,460 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:48:37,460 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:37,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:48:37,461 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-07 01:48:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:48:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2020670576, now seen corresponding path program 1 times [2021-11-07 01:48:37,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:48:37,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829152991] [2021-11-07 01:48:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:48:37,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:48:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:48:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:48:37,514 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:48:37,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829152991] [2021-11-07 01:48:37,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829152991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:48:37,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:48:37,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:48:37,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154399741] [2021-11-07 01:48:37,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:48:37,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:48:37,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:48:37,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:48:37,516 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:48:37,530 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2021-11-07 01:48:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:48:37,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 01:48:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:48:37,531 INFO L225 Difference]: With dead ends: 26 [2021-11-07 01:48:37,531 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 01:48:37,532 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:48:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 01:48:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 01:48:37,532 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) [2021-11-07 01:48:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 01:48:37,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-11-07 01:48:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:48:37,533 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 01:48:37,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:48:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 01:48:37,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 01:48:37,536 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,536 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,536 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,537 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,537 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,537 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,537 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,537 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,538 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,538 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,538 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,538 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,538 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,540 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,540 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,540 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,540 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,540 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,541 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,541 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,541 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,541 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,541 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:48:37,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:48:37,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 01:48:37,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:37,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:48:38,222 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,222 INFO L857 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2021-11-07 01:48:38,223 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,223 INFO L857 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2021-11-07 01:48:38,223 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,223 INFO L857 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2021-11-07 01:48:38,223 INFO L857 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2021-11-07 01:48:38,223 INFO L853 garLoopResultBuilder]: At program point L368(lines 368 409) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,223 INFO L853 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,224 INFO L857 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2021-11-07 01:48:38,224 INFO L853 garLoopResultBuilder]: At program point L108(lines 108 291) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,224 INFO L853 garLoopResultBuilder]: At program point L373(lines 373 408) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,224 INFO L857 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2021-11-07 01:48:38,224 INFO L857 garLoopResultBuilder]: For program point L638-1(lines 638 656) no Hoare annotation was computed. [2021-11-07 01:48:38,224 INFO L857 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2021-11-07 01:48:38,224 INFO L853 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-11-07 01:48:38,224 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2021-11-07 01:48:38,225 INFO L853 garLoopResultBuilder]: At program point L111(lines 111 290) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,225 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,225 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,225 INFO L857 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2021-11-07 01:48:38,225 INFO L857 garLoopResultBuilder]: For program point L641-1(lines 641 655) no Hoare annotation was computed. [2021-11-07 01:48:38,225 INFO L857 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2021-11-07 01:48:38,225 INFO L853 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,225 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,226 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,226 INFO L853 garLoopResultBuilder]: At program point L114(lines 114 289) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,226 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,226 INFO L857 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2021-11-07 01:48:38,226 INFO L857 garLoopResultBuilder]: For program point L644-1(lines 644 654) no Hoare annotation was computed. [2021-11-07 01:48:38,226 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,226 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2021-11-07 01:48:38,226 INFO L853 garLoopResultBuilder]: At program point L182-1(lines 1 1016) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-11-07 01:48:38,226 INFO L853 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,227 INFO L853 garLoopResultBuilder]: At program point L645-1(lines 638 656) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,227 INFO L857 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2021-11-07 01:48:38,227 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2021-11-07 01:48:38,227 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2021-11-07 01:48:38,227 INFO L853 garLoopResultBuilder]: At program point L54(lines 347 349) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,227 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 01:48:38,227 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,227 INFO L857 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2021-11-07 01:48:38,227 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,228 INFO L853 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,228 INFO L853 garLoopResultBuilder]: At program point L653-1(lines 641 655) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,228 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,228 INFO L853 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (not (= ~MPR3~0 ~s~0))) [2021-11-07 01:48:38,228 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,228 INFO L853 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,228 INFO L853 garLoopResultBuilder]: At program point L524-1(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,229 INFO L853 garLoopResultBuilder]: At program point L524-2(lines 488 552) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~MPR1~0 ~s~0)) [2021-11-07 01:48:38,229 INFO L853 garLoopResultBuilder]: At program point L524-3(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,229 INFO L853 garLoopResultBuilder]: At program point L524-4(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,229 INFO L853 garLoopResultBuilder]: At program point L524-5(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,229 INFO L853 garLoopResultBuilder]: At program point L524-6(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,229 INFO L853 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,229 INFO L853 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,229 INFO L857 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2021-11-07 01:48:38,230 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,230 INFO L857 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2021-11-07 01:48:38,230 INFO L853 garLoopResultBuilder]: At program point L594-1(lines 594 598) the Hoare annotation is: (and (= ~compRegistered~0 1) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-11-07 01:48:38,230 INFO L853 garLoopResultBuilder]: At program point L330(lines 324 465) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-11-07 01:48:38,230 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2021-11-07 01:48:38,230 INFO L857 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2021-11-07 01:48:38,230 INFO L860 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2021-11-07 01:48:38,230 INFO L857 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2021-11-07 01:48:38,230 INFO L857 garLoopResultBuilder]: For program point L532-1(lines 532 549) no Hoare annotation was computed. [2021-11-07 01:48:38,231 INFO L857 garLoopResultBuilder]: For program point L532-2(lines 532 549) no Hoare annotation was computed. [2021-11-07 01:48:38,231 INFO L857 garLoopResultBuilder]: For program point L532-3(lines 532 549) no Hoare annotation was computed. [2021-11-07 01:48:38,231 INFO L857 garLoopResultBuilder]: For program point L532-4(lines 532 549) no Hoare annotation was computed. [2021-11-07 01:48:38,231 INFO L857 garLoopResultBuilder]: For program point L532-5(lines 532 549) no Hoare annotation was computed. [2021-11-07 01:48:38,231 INFO L857 garLoopResultBuilder]: For program point L532-6(lines 532 549) no Hoare annotation was computed. [2021-11-07 01:48:38,231 INFO L857 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2021-11-07 01:48:38,231 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,237 INFO L853 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-11-07 01:48:38,237 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,237 INFO L857 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2021-11-07 01:48:38,237 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,238 INFO L857 garLoopResultBuilder]: For program point L471(lines 471 477) no Hoare annotation was computed. [2021-11-07 01:48:38,238 INFO L857 garLoopResultBuilder]: For program point L471-2(lines 471 477) no Hoare annotation was computed. [2021-11-07 01:48:38,238 INFO L857 garLoopResultBuilder]: For program point L471-4(lines 471 477) no Hoare annotation was computed. [2021-11-07 01:48:38,238 INFO L857 garLoopResultBuilder]: For program point L471-6(lines 471 477) no Hoare annotation was computed. [2021-11-07 01:48:38,238 INFO L857 garLoopResultBuilder]: For program point L471-8(lines 471 477) no Hoare annotation was computed. [2021-11-07 01:48:38,238 INFO L857 garLoopResultBuilder]: For program point L471-10(lines 471 477) no Hoare annotation was computed. [2021-11-07 01:48:38,239 INFO L857 garLoopResultBuilder]: For program point L471-12(lines 471 477) no Hoare annotation was computed. [2021-11-07 01:48:38,239 INFO L857 garLoopResultBuilder]: For program point L471-14(lines 471 477) no Hoare annotation was computed. [2021-11-07 01:48:38,239 INFO L857 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2021-11-07 01:48:38,239 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,239 INFO L853 garLoopResultBuilder]: At program point L76(lines 330 413) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2021-11-07 01:48:38,240 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,240 INFO L853 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,240 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,240 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,240 INFO L857 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2021-11-07 01:48:38,240 INFO L857 garLoopResultBuilder]: For program point L541-2(lines 541 548) no Hoare annotation was computed. [2021-11-07 01:48:38,241 INFO L857 garLoopResultBuilder]: For program point L541-4(lines 541 548) no Hoare annotation was computed. [2021-11-07 01:48:38,241 INFO L857 garLoopResultBuilder]: For program point L541-6(lines 541 548) no Hoare annotation was computed. [2021-11-07 01:48:38,241 INFO L857 garLoopResultBuilder]: For program point L541-8(lines 541 548) no Hoare annotation was computed. [2021-11-07 01:48:38,241 INFO L857 garLoopResultBuilder]: For program point L541-10(lines 541 548) no Hoare annotation was computed. [2021-11-07 01:48:38,241 INFO L857 garLoopResultBuilder]: For program point L541-12(lines 541 548) no Hoare annotation was computed. [2021-11-07 01:48:38,241 INFO L857 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2021-11-07 01:48:38,242 INFO L857 garLoopResultBuilder]: For program point L674-2(lines 674 680) no Hoare annotation was computed. [2021-11-07 01:48:38,242 INFO L857 garLoopResultBuilder]: For program point L674-4(lines 674 680) no Hoare annotation was computed. [2021-11-07 01:48:38,242 INFO L853 garLoopResultBuilder]: At program point L1005(lines 822 1007) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,242 INFO L857 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2021-11-07 01:48:38,242 INFO L857 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2021-11-07 01:48:38,242 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,243 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,243 INFO L857 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2021-11-07 01:48:38,243 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 01:48:38,243 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,243 INFO L857 garLoopResultBuilder]: For program point L1013(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,243 INFO L857 garLoopResultBuilder]: For program point L1013-1(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,244 INFO L857 garLoopResultBuilder]: For program point L1013-2(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,244 INFO L857 garLoopResultBuilder]: For program point L1013-3(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,244 INFO L857 garLoopResultBuilder]: For program point L1013-4(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,244 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,244 INFO L857 garLoopResultBuilder]: For program point L1013-5(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,244 INFO L857 garLoopResultBuilder]: For program point L1013-6(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,245 INFO L857 garLoopResultBuilder]: For program point L1013-7(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,245 INFO L857 garLoopResultBuilder]: For program point L1013-8(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,245 INFO L857 garLoopResultBuilder]: For program point L1013-9(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,245 INFO L857 garLoopResultBuilder]: For program point L1013-10(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,245 INFO L857 garLoopResultBuilder]: For program point L1013-11(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,245 INFO L857 garLoopResultBuilder]: For program point L1013-12(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,245 INFO L857 garLoopResultBuilder]: For program point L1013-13(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,246 INFO L857 garLoopResultBuilder]: For program point L1013-14(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,246 INFO L857 garLoopResultBuilder]: For program point L1013-15(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,246 INFO L857 garLoopResultBuilder]: For program point L1013-16(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,246 INFO L857 garLoopResultBuilder]: For program point L1013-17(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,246 INFO L857 garLoopResultBuilder]: For program point L1013-18(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,246 INFO L857 garLoopResultBuilder]: For program point L1013-19(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,247 INFO L853 garLoopResultBuilder]: At program point L353(lines 353 412) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,247 INFO L857 garLoopResultBuilder]: For program point L1013-20(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,247 INFO L857 garLoopResultBuilder]: For program point L1013-21(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,247 INFO L857 garLoopResultBuilder]: For program point L1013-22(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,247 INFO L857 garLoopResultBuilder]: For program point L1013-23(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,247 INFO L857 garLoopResultBuilder]: For program point L1013-24(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,247 INFO L857 garLoopResultBuilder]: For program point L1013-25(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,248 INFO L857 garLoopResultBuilder]: For program point L1013-26(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,248 INFO L857 garLoopResultBuilder]: For program point L1013-27(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,249 INFO L857 garLoopResultBuilder]: For program point L1013-28(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,249 INFO L853 garLoopResultBuilder]: At program point L1014(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,249 INFO L853 garLoopResultBuilder]: At program point L1014-2(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,249 INFO L853 garLoopResultBuilder]: At program point L1014-3(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,249 INFO L853 garLoopResultBuilder]: At program point L1014-5(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,250 INFO L853 garLoopResultBuilder]: At program point L1014-9(lines 1 1016) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (or (and (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) .cse0) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (or .cse0 (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0))) [2021-11-07 01:48:38,250 INFO L853 garLoopResultBuilder]: At program point L1014-12(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,250 INFO L853 garLoopResultBuilder]: At program point L1014-14(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,250 INFO L853 garLoopResultBuilder]: At program point L1014-15(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,250 INFO L853 garLoopResultBuilder]: At program point L1014-17(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,250 INFO L853 garLoopResultBuilder]: At program point L1014-18(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,251 INFO L853 garLoopResultBuilder]: At program point L1014-20(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,251 INFO L853 garLoopResultBuilder]: At program point L1014-21(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,252 INFO L853 garLoopResultBuilder]: At program point L1014-23(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,252 INFO L853 garLoopResultBuilder]: At program point L1014-24(lines 554 567) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,252 INFO L853 garLoopResultBuilder]: At program point L1014-25(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,252 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,252 INFO L853 garLoopResultBuilder]: At program point L1014-27(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,252 INFO L853 garLoopResultBuilder]: At program point L883(lines 883 988) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,253 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,253 INFO L853 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-11-07 01:48:38,254 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2021-11-07 01:48:38,254 INFO L853 garLoopResultBuilder]: At program point L489(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,256 INFO L853 garLoopResultBuilder]: At program point L489-1(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,256 INFO L853 garLoopResultBuilder]: At program point L489-2(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,256 INFO L857 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-11-07 01:48:38,256 INFO L853 garLoopResultBuilder]: At program point L489-3(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,257 INFO L853 garLoopResultBuilder]: At program point L489-4(lines 489 501) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-11-07 01:48:38,257 INFO L853 garLoopResultBuilder]: At program point L489-5(lines 489 501) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~MPR1~0 ~s~0)) [2021-11-07 01:48:38,257 INFO L853 garLoopResultBuilder]: At program point L489-6(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,257 INFO L853 garLoopResultBuilder]: At program point L489-7(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,257 INFO L853 garLoopResultBuilder]: At program point L489-8(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,258 INFO L853 garLoopResultBuilder]: At program point L489-9(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,258 INFO L853 garLoopResultBuilder]: At program point L489-10(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,258 INFO L853 garLoopResultBuilder]: At program point L489-11(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,258 INFO L853 garLoopResultBuilder]: At program point L489-12(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,258 INFO L853 garLoopResultBuilder]: At program point L489-13(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,259 INFO L853 garLoopResultBuilder]: At program point L754(lines 754 766) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,259 INFO L853 garLoopResultBuilder]: At program point L754-1(lines 754 766) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,259 INFO L853 garLoopResultBuilder]: At program point L358(lines 358 411) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,259 INFO L857 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2021-11-07 01:48:38,259 INFO L857 garLoopResultBuilder]: For program point L558-2(lines 558 564) no Hoare annotation was computed. [2021-11-07 01:48:38,260 INFO L853 garLoopResultBuilder]: At program point L891(lines 891 986) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,260 INFO L857 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2021-11-07 01:48:38,260 INFO L857 garLoopResultBuilder]: For program point L495-2(lines 495 499) no Hoare annotation was computed. [2021-11-07 01:48:38,261 INFO L853 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-11-07 01:48:38,261 INFO L853 garLoopResultBuilder]: At program point L363(lines 363 410) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-11-07 01:48:38,261 INFO L857 garLoopResultBuilder]: For program point L495-4(lines 495 499) no Hoare annotation was computed. [2021-11-07 01:48:38,261 INFO L857 garLoopResultBuilder]: For program point L495-6(lines 495 499) no Hoare annotation was computed. [2021-11-07 01:48:38,261 INFO L857 garLoopResultBuilder]: For program point L495-8(lines 495 499) no Hoare annotation was computed. [2021-11-07 01:48:38,262 INFO L857 garLoopResultBuilder]: For program point L495-10(lines 495 499) no Hoare annotation was computed. [2021-11-07 01:48:38,262 INFO L857 garLoopResultBuilder]: For program point L495-12(lines 495 499) no Hoare annotation was computed. [2021-11-07 01:48:38,262 INFO L857 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2021-11-07 01:48:38,262 INFO L860 garLoopResultBuilder]: At program point L430(lines 414 463) the Hoare annotation is: true [2021-11-07 01:48:38,262 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,262 INFO L857 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2021-11-07 01:48:38,263 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-11-07 01:48:38,266 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:48:38,267 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:48:38,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:48:38 BoogieIcfgContainer [2021-11-07 01:48:38,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:48:38,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:48:38,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:48:38,332 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:48:38,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:35" (3/4) ... [2021-11-07 01:48:38,336 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 01:48:38,373 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 151 nodes and edges [2021-11-07 01:48:38,377 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2021-11-07 01:48:38,380 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-07 01:48:38,383 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:48:38,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:48:38,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:48:38,565 INFO L168 Benchmark]: Toolchain (without parser) took 5987.08 ms. Allocated memory was 102.8 MB in the beginning and 155.2 MB in the end (delta: 52.4 MB). Free memory was 64.8 MB in the beginning and 103.7 MB in the end (delta: -38.9 MB). Peak memory consumption was 75.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:38,566 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 102.8 MB. Free memory was 72.8 MB in the beginning and 72.8 MB in the end (delta: 27.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:48:38,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.27 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 64.8 MB in the beginning and 89.6 MB in the end (delta: -24.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:38,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.94 ms. Allocated memory is still 123.7 MB. Free memory was 89.6 MB in the beginning and 83.8 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:38,567 INFO L168 Benchmark]: Boogie Preprocessor took 66.93 ms. Allocated memory is still 123.7 MB. Free memory was 83.2 MB in the beginning and 79.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:38,567 INFO L168 Benchmark]: RCFGBuilder took 2229.45 ms. Allocated memory is still 123.7 MB. Free memory was 79.7 MB in the beginning and 58.0 MB in the end (delta: 21.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:38,567 INFO L168 Benchmark]: TraceAbstraction took 2856.65 ms. Allocated memory was 123.7 MB in the beginning and 155.2 MB in the end (delta: 31.5 MB). Free memory was 57.6 MB in the beginning and 51.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 40.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:38,568 INFO L168 Benchmark]: Witness Printer took 232.17 ms. Allocated memory is still 155.2 MB. Free memory was 51.7 MB in the beginning and 103.7 MB in the end (delta: -51.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. [2021-11-07 01:48:38,570 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.31 ms. Allocated memory is still 102.8 MB. Free memory was 72.8 MB in the beginning and 72.8 MB in the end (delta: 27.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 443.27 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 64.8 MB in the beginning and 89.6 MB in the end (delta: -24.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 151.94 ms. Allocated memory is still 123.7 MB. Free memory was 89.6 MB in the beginning and 83.8 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.93 ms. Allocated memory is still 123.7 MB. Free memory was 83.2 MB in the beginning and 79.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2229.45 ms. Allocated memory is still 123.7 MB. Free memory was 79.7 MB in the beginning and 58.0 MB in the end (delta: 21.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2856.65 ms. Allocated memory was 123.7 MB in the beginning and 155.2 MB in the end (delta: 31.5 MB). Free memory was 57.6 MB in the beginning and 51.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 40.4 MB. Max. memory is 16.1 GB. * Witness Printer took 232.17 ms. Allocated memory is still 155.2 MB. Free memory was 51.7 MB in the beginning and 103.7 MB in the end (delta: -51.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. * 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: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: 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, 198 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1676 SDtfs, 925 SDslu, 757 SDs, 0 SdLazy, 446 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 131 NumberOfFragments, 1301 HoareAnnotationTreeSize, 71 FomulaSimplifications, 115 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 71 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 29 specifications checked. All of them hold - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1 && setEventCalled == 1) && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && !(MPR3 == s) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: !(pended == 1) && NP + 4 <= MPR1 - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: !(pended == 1) && NP + 4 <= MPR1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: !(pended == 1) && NP + 4 <= MPR1 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1 && setEventCalled == 1) && ((259 <= returnVal2 && returnVal2 <= 259) || s == NP)) && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && (s == NP || MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && setEventCalled == 1) && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && NP + 4 <= MPR1) && MPR1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 594]: Loop Invariant Derived loop invariant: ((((compRegistered == 1 && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && s == NP) && NP + 4 <= MPR1 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: !(pended == 1) && NP + 4 <= MPR1 - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 822]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((compRegistered == 1 && status == 0) && !(pended == 1)) && s == NP) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && setEventCalled == 1) && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && NP + 4 <= MPR1) && MPR1 == s - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (status == 0 && !(pended == 1)) && NP + 4 <= MPR1 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((compRegistered == 1 && status == 0) && !(pended == 1)) && s == NP) && NP + 4 <= MPR1 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0) && !(MPR3 == s) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2021-11-07 01:48:38,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6409882-8a11-4a4e-b3f1-f22b5277e7a9/bin/utaipan-UUZaoUuFF8/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