./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9 --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 64bit --witnessprinter.graph.data.programhash 6270eb1b6253e856606c006aad6f25958ddccc57a27345214c2cf80ca93686b2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:36:01,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:36:01,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:36:01,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:36:01,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:36:01,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:36:01,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:36:01,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:36:01,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:36:01,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:36:01,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:36:01,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:36:01,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:36:01,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:36:01,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:36:01,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:36:01,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:36:01,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:36:01,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:36:01,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:36:01,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:36:01,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:36:01,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:36:01,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:36:01,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:36:01,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:36:01,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:36:01,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:36:01,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:36:01,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:36:01,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:36:01,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:36:01,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:36:01,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:36:01,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:36:01,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:36:01,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:36:01,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:36:01,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:36:01,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:36:01,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:36:01,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-20 20:36:01,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:36:01,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:36:01,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:36:01,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:36:01,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:36:01,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:36:01,289 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:36:01,289 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:36:01,290 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:36:01,290 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:36:01,291 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:36:01,291 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:36:01,292 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:36:01,292 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:36:01,292 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:36:01,292 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:36:01,293 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:36:01,293 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:36:01,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:36:01,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:36:01,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:36:01,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:36:01,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:36:01,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:36:01,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:36:01,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:36:01,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:36:01,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:36:01,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:36:01,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:36:01,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:36:01,298 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:36:01,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:36:01,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:36:01,298 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:36:01,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:36:01,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:36:01,299 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:36:01,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/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_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6270eb1b6253e856606c006aad6f25958ddccc57a27345214c2cf80ca93686b2 [2022-11-20 20:36:01,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:36:01,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:36:01,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:36:01,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:36:01,668 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:36:01,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c [2022-11-20 20:36:04,783 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:36:05,013 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:36:05,014 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c [2022-11-20 20:36:05,020 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/data/3e8a28dcf/ac51f38bfe2342feb2f222e519bbb8e7/FLAG62b08b3d5 [2022-11-20 20:36:05,034 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/data/3e8a28dcf/ac51f38bfe2342feb2f222e519bbb8e7 [2022-11-20 20:36:05,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:36:05,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:36:05,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:36:05,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:36:05,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:36:05,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd8d97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05, skipping insertion in model container [2022-11-20 20:36:05,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:36:05,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:36:05,200 WARN L237 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_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c[1117,1130] [2022-11-20 20:36:05,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:36:05,235 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:36:05,246 WARN L237 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_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c[1117,1130] [2022-11-20 20:36:05,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:36:05,271 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:36:05,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05 WrapperNode [2022-11-20 20:36:05,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:36:05,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:36:05,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:36:05,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:36:05,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,307 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2022-11-20 20:36:05,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:36:05,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:36:05,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:36:05,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:36:05,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,327 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:36:05,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:36:05,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:36:05,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:36:05,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (1/1) ... [2022-11-20 20:36:05,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:36:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:36:05,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:36:05,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:36:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:36:05,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:36:05,512 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:36:05,514 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:36:05,700 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:36:05,730 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:36:05,731 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 20:36:05,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:36:05 BoogieIcfgContainer [2022-11-20 20:36:05,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:36:05,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:36:05,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:36:05,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:36:05,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:36:05" (1/3) ... [2022-11-20 20:36:05,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a85d2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:36:05, skipping insertion in model container [2022-11-20 20:36:05,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:05" (2/3) ... [2022-11-20 20:36:05,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a85d2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:36:05, skipping insertion in model container [2022-11-20 20:36:05,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:36:05" (3/3) ... [2022-11-20 20:36:05,763 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.recount4.c [2022-11-20 20:36:05,811 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:36:05,811 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 20:36:05,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:36:05,890 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45f32ffb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:36:05,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 20:36:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 20:36:05,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:36:05,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 20:36:05,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:36:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:36:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2022-11-20 20:36:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:36:05,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705743278] [2022-11-20 20:36:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:36:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:36:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:36:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:06,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:36:06,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705743278] [2022-11-20 20:36:06,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705743278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:36:06,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:36:06,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:36:06,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715987264] [2022-11-20 20:36:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:36:06,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:36:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:36:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:36:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:36:06,587 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:36:06,645 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-11-20 20:36:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:36:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-20 20:36:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:36:06,656 INFO L225 Difference]: With dead ends: 15 [2022-11-20 20:36:06,656 INFO L226 Difference]: Without dead ends: 9 [2022-11-20 20:36:06,660 INFO L412 NwaCegarLoop]: 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 [2022-11-20 20:36:06,663 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:36:06,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:36:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-20 20:36:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-11-20 20:36:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-11-20 20:36:06,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2022-11-20 20:36:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:36:06,696 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-11-20 20:36:06,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-11-20 20:36:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 20:36:06,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:36:06,697 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-11-20 20:36:06,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:36:06,698 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:36:06,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:36:06,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2022-11-20 20:36:06,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:36:06,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154501502] [2022-11-20 20:36:06,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:36:06,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:36:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:36:06,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 20:36:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:36:06,946 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 20:36:06,947 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 20:36:06,949 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 20:36:06,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:36:06,955 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-20 20:36:06,961 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:36:06,989 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:36:06,989 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:36:06,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:36:06 BoogieIcfgContainer [2022-11-20 20:36:06,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:36:06,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:36:06,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:36:06,997 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:36:06,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:36:05" (3/4) ... [2022-11-20 20:36:07,000 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 20:36:07,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:36:07,001 INFO L158 Benchmark]: Toolchain (without parser) took 1962.77ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 146.5MB in the end (delta: 8.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-11-20 20:36:07,001 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:36:07,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.56ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 145.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 20:36:07,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.61ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 143.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:36:07,003 INFO L158 Benchmark]: Boogie Preprocessor took 22.60ms. Allocated memory is still 201.3MB. Free memory was 143.6MB in the beginning and 142.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:36:07,004 INFO L158 Benchmark]: RCFGBuilder took 403.09ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 131.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 20:36:07,004 INFO L158 Benchmark]: TraceAbstraction took 1240.38ms. Allocated memory is still 201.3MB. Free memory was 130.2MB in the beginning and 147.5MB in the end (delta: -17.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:36:07,005 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 201.3MB. Free memory was 147.5MB in the beginning and 146.5MB in the end (delta: 996.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:36:07,007 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.56ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 145.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.61ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 143.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.60ms. Allocated memory is still 201.3MB. Free memory was 143.6MB in the beginning and 142.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.09ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 131.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1240.38ms. Allocated memory is still 201.3MB. Free memory was 130.2MB in the beginning and 147.5MB in the end (delta: -17.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 201.3MB. Free memory was 147.5MB in the beginning and 146.5MB in the end (delta: 996.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 0; [L33] const SORT_4 var_8 = 1; [L34] const SORT_4 var_13 = mask_SORT_4; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L39] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] SORT_4 init_7_arg_1 = var_5; [L42] state_6 = init_7_arg_1 VAL [init_7_arg_1=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=0, var_13=15, var_5=0, var_8=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=15, state_6=15, var_10=1, var_10_arg_0=1, var_10_arg_1=1, var_10_arg_2=0, var_11=15, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=1, var_13=15, var_14=0, var_14_arg_0=0, var_14_arg_1=15, var_5=0, var_8=1, var_9=1, var_9_arg_0=0, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=1, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 20:36:07,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9 --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 64bit --witnessprinter.graph.data.programhash 6270eb1b6253e856606c006aad6f25958ddccc57a27345214c2cf80ca93686b2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:36:09,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:36:09,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:36:09,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:36:09,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:36:09,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:36:09,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:36:09,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:36:09,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:36:09,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:36:09,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:36:09,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:36:09,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:36:09,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:36:09,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:36:09,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:36:09,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:36:09,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:36:09,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:36:09,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:36:09,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:36:09,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:36:09,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:36:09,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:36:09,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:36:09,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:36:09,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:36:09,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:36:09,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:36:09,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:36:09,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:36:09,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:36:09,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:36:09,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:36:09,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:36:09,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:36:09,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:36:09,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:36:09,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:36:09,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:36:09,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:36:09,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2022-11-20 20:36:09,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:36:09,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:36:09,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:36:09,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:36:09,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:36:09,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:36:09,686 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:36:09,686 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:36:09,687 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:36:09,687 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:36:09,687 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:36:09,687 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:36:09,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:36:09,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:36:09,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:36:09,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:36:09,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:36:09,690 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:36:09,690 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 20:36:09,690 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 20:36:09,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:36:09,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:36:09,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:36:09,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:36:09,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 20:36:09,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:36:09,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:36:09,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:36:09,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:36:09,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:36:09,693 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-20 20:36:09,693 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 20:36:09,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:36:09,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:36:09,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 20:36:09,694 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/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_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6270eb1b6253e856606c006aad6f25958ddccc57a27345214c2cf80ca93686b2 [2022-11-20 20:36:10,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:36:10,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:36:10,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:36:10,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:36:10,083 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:36:10,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c [2022-11-20 20:36:13,224 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:36:13,402 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:36:13,403 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c [2022-11-20 20:36:13,410 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/data/1f73bc664/123ac88ff9dd4a6a8b51e26fe7d1b4b2/FLAG0f1a4c749 [2022-11-20 20:36:13,430 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/data/1f73bc664/123ac88ff9dd4a6a8b51e26fe7d1b4b2 [2022-11-20 20:36:13,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:36:13,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:36:13,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:36:13,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:36:13,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:36:13,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7302ba30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13, skipping insertion in model container [2022-11-20 20:36:13,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:36:13,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:36:13,597 WARN L237 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_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c[1117,1130] [2022-11-20 20:36:13,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:36:13,639 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:36:13,651 WARN L237 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_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c[1117,1130] [2022-11-20 20:36:13,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:36:13,677 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:36:13,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13 WrapperNode [2022-11-20 20:36:13,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:36:13,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:36:13,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:36:13,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:36:13,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,727 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2022-11-20 20:36:13,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:36:13,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:36:13,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:36:13,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:36:13,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,761 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:36:13,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:36:13,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:36:13,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:36:13,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (1/1) ... [2022-11-20 20:36:13,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:36:13,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:36:13,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:36:13,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:36:13,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:36:13,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:36:13,961 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:36:13,963 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:36:14,095 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:36:14,103 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:36:14,103 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 20:36:14,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:36:14 BoogieIcfgContainer [2022-11-20 20:36:14,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:36:14,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:36:14,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:36:14,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:36:14,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:36:13" (1/3) ... [2022-11-20 20:36:14,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2351ef34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:36:14, skipping insertion in model container [2022-11-20 20:36:14,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:13" (2/3) ... [2022-11-20 20:36:14,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2351ef34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:36:14, skipping insertion in model container [2022-11-20 20:36:14,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:36:14" (3/3) ... [2022-11-20 20:36:14,121 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.recount4.c [2022-11-20 20:36:14,143 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:36:14,143 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 20:36:14,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:36:14,232 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45aaf3b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:36:14,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 20:36:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:36:14,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:36:14,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:36:14,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:36:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:36:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-11-20 20:36:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:36:14,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160505899] [2022-11-20 20:36:14,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:36:14,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:36:14,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:36:14,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:36:14,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 20:36:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:36:14,373 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 20:36:14,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:14,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:36:14,590 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:36:14,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160505899] [2022-11-20 20:36:14,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160505899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:36:14,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:36:14,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:36:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692053151] [2022-11-20 20:36:14,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:36:14,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:36:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:36:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:36:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:36:14,632 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:36:14,711 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2022-11-20 20:36:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:36:14,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-20 20:36:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:36:14,722 INFO L225 Difference]: With dead ends: 20 [2022-11-20 20:36:14,723 INFO L226 Difference]: Without dead ends: 11 [2022-11-20 20:36:14,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:36:14,729 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:36:14,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:36:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-20 20:36:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2022-11-20 20:36:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) [2022-11-20 20:36:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-20 20:36:14,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-11-20 20:36:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:36:14,765 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-20 20:36:14,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-20 20:36:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 20:36:14,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:36:14,766 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-20 20:36:14,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:36:14,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:36:14,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:36:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:36:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2022-11-20 20:36:14,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:36:14,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594799118] [2022-11-20 20:36:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:36:14,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:36:14,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:36:14,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:36:15,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 20:36:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:36:15,066 WARN L261 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 20:36:15,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:15,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:15,634 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:36:15,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594799118] [2022-11-20 20:36:15,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594799118] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:15,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1966019795] [2022-11-20 20:36:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:36:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:36:15,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:36:15,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:36:15,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-11-20 20:36:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:36:15,718 WARN L261 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-20 20:36:15,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:15,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:15,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1966019795] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:15,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200752786] [2022-11-20 20:36:15,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:36:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:36:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:36:16,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:36:16,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:36:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:36:16,067 WARN L261 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-20 20:36:16,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:16,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:16,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200752786] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:16,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:36:16,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6, 6] total 10 [2022-11-20 20:36:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640465192] [2022-11-20 20:36:16,468 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:36:16,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:36:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:36:16,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:36:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:36:16,471 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 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) [2022-11-20 20:36:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:36:16,648 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-11-20 20:36:16,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:36:16,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 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 8 [2022-11-20 20:36:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:36:16,650 INFO L225 Difference]: With dead ends: 19 [2022-11-20 20:36:16,650 INFO L226 Difference]: Without dead ends: 17 [2022-11-20 20:36:16,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-20 20:36:16,652 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:36:16,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 19 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:36:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-20 20:36:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-11-20 20:36:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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) [2022-11-20 20:36:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-20 20:36:16,660 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-20 20:36:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:36:16,660 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-20 20:36:16,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 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) [2022-11-20 20:36:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-20 20:36:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 20:36:16,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:36:16,662 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2022-11-20 20:36:16,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:36:16,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:36:17,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 20:36:17,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:36:17,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:36:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:36:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 2 times [2022-11-20 20:36:17,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:36:17,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721124726] [2022-11-20 20:36:17,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 20:36:17,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:36:17,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:36:17,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:36:17,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 20:36:17,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 20:36:17,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:36:17,344 WARN L261 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-20 20:36:17,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:18,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:19,493 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:36:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721124726] [2022-11-20 20:36:19,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721124726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [597120591] [2022-11-20 20:36:19,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 20:36:19,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:36:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:36:19,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:36:19,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-20 20:36:19,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 20:36:19,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:36:19,606 WARN L261 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 20:36:19,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:20,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:21,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [597120591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:21,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126722170] [2022-11-20 20:36:21,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 20:36:21,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:36:21,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:36:21,012 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:36:21,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:36:21,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 20:36:21,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:36:21,088 WARN L261 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-20 20:36:21,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:21,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:23,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126722170] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:23,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:36:23,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7, 7, 9, 11] total 20 [2022-11-20 20:36:23,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740664655] [2022-11-20 20:36:23,121 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:36:23,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 20:36:23,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:36:23,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 20:36:23,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2022-11-20 20:36:23,124 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:36:24,134 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-20 20:36:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:36:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-20 20:36:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:36:24,135 INFO L225 Difference]: With dead ends: 31 [2022-11-20 20:36:24,135 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 20:36:24,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2022-11-20 20:36:24,137 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 75 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:36:24,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 29 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:36:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 20:36:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-20 20:36:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-20 20:36:24,152 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2022-11-20 20:36:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:36:24,153 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-20 20:36:24,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:36:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-20 20:36:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 20:36:24,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:36:24,155 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2022-11-20 20:36:24,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 20:36:24,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:36:24,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:36:24,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:36:24,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:36:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:36:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -752690141, now seen corresponding path program 3 times [2022-11-20 20:36:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:36:24,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037149521] [2022-11-20 20:36:24,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:36:24,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:36:24,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:36:24,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:36:24,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-20 20:36:24,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 20:36:24,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:36:24,888 WARN L261 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-20 20:36:24,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:27,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:38,322 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:36:38,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037149521] [2022-11-20 20:36:38,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037149521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:38,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [149262532] [2022-11-20 20:36:38,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:36:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:36:38,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:36:38,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:36:38,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-20 20:36:38,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 20:36:38,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:36:38,587 WARN L261 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-20 20:36:38,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:39,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:48,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [149262532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:48,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105350359] [2022-11-20 20:36:48,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:36:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:36:48,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:36:48,595 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:36:48,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 20:36:48,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 20:36:48,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:36:48,718 WARN L261 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-20 20:36:48,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:36:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:50,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:36:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:36:59,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105350359] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:36:59,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:36:59,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13, 13, 14] total 25 [2022-11-20 20:36:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707202885] [2022-11-20 20:36:59,351 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:36:59,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 20:36:59,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:36:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 20:36:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2022-11-20 20:36:59,357 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:37:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:37:06,260 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-20 20:37:06,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:37:06,261 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 20:37:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:37:06,264 INFO L225 Difference]: With dead ends: 55 [2022-11-20 20:37:06,264 INFO L226 Difference]: Without dead ends: 53 [2022-11-20 20:37:06,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=539, Invalid=1021, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 20:37:06,271 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 130 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:37:06,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 34 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 20:37:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-20 20:37:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-11-20 20:37:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:37:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-11-20 20:37:06,317 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2022-11-20 20:37:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:37:06,318 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-11-20 20:37:06,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:37:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-11-20 20:37:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 20:37:06,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:37:06,325 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2022-11-20 20:37:06,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:37:06,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 20:37:06,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:37:06,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt [2022-11-20 20:37:06,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:37:06,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:37:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash -779438813, now seen corresponding path program 4 times [2022-11-20 20:37:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:37:06,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980411526] [2022-11-20 20:37:06,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:37:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:37:06,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:37:06,942 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:37:06,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-20 20:37:07,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:37:07,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 20:37:07,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 20:37:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:37:07,281 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-20 20:37:07,281 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 20:37:07,282 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 20:37:07,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-20 20:37:07,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:37:07,502 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2022-11-20 20:37:07,504 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:37:07,552 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,553 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,553 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,553 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,553 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,553 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,553 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,553 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,554 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,554 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,554 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,554 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,554 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,554 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,554 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,554 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:37:07 BoogieIcfgContainer [2022-11-20 20:37:07,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:37:07,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:37:07,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:37:07,596 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:37:07,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:36:14" (3/4) ... [2022-11-20 20:37:07,599 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 20:37:07,634 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,634 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,634 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,634 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,634 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,634 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,634 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,634 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,635 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,635 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,635 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,635 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,635 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,635 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,635 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,635 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 20:37:07,720 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 20:37:07,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:37:07,721 INFO L158 Benchmark]: Toolchain (without parser) took 54285.60ms. Allocated memory was 71.3MB in the beginning and 314.6MB in the end (delta: 243.3MB). Free memory was 42.7MB in the beginning and 197.8MB in the end (delta: -155.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2022-11-20 20:37:07,721 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 71.3MB. Free memory was 48.3MB in the beginning and 48.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:37:07,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.88ms. Allocated memory is still 71.3MB. Free memory was 42.6MB in the beginning and 32.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 20:37:07,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.76ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 30.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:37:07,722 INFO L158 Benchmark]: Boogie Preprocessor took 35.77ms. Allocated memory is still 71.3MB. Free memory was 30.3MB in the beginning and 29.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:37:07,723 INFO L158 Benchmark]: RCFGBuilder took 340.82ms. Allocated memory is still 71.3MB. Free memory was 29.2MB in the beginning and 42.6MB in the end (delta: -13.4MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2022-11-20 20:37:07,723 INFO L158 Benchmark]: TraceAbstraction took 53487.23ms. Allocated memory was 71.3MB in the beginning and 314.6MB in the end (delta: 243.3MB). Free memory was 42.0MB in the beginning and 208.3MB in the end (delta: -166.3MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2022-11-20 20:37:07,723 INFO L158 Benchmark]: Witness Printer took 124.55ms. Allocated memory is still 314.6MB. Free memory was 208.3MB in the beginning and 197.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 20:37:07,725 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 71.3MB. Free memory was 48.3MB in the beginning and 48.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.88ms. Allocated memory is still 71.3MB. Free memory was 42.6MB in the beginning and 32.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.76ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 30.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.77ms. Allocated memory is still 71.3MB. Free memory was 30.3MB in the beginning and 29.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.82ms. Allocated memory is still 71.3MB. Free memory was 29.2MB in the beginning and 42.6MB in the end (delta: -13.4MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * TraceAbstraction took 53487.23ms. Allocated memory was 71.3MB in the beginning and 314.6MB in the end (delta: 243.3MB). Free memory was 42.0MB in the beginning and 208.3MB in the end (delta: -166.3MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Witness Printer took 124.55ms. Allocated memory is still 314.6MB. Free memory was 208.3MB in the beginning and 197.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 0; [L33] const SORT_4 var_8 = 1; [L34] const SORT_4 var_13 = mask_SORT_4; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L39] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] SORT_4 init_7_arg_1 = var_5; [L42] state_6 = init_7_arg_1 VAL [init_7_arg_1=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=0, var_13=15, var_5=0, var_8=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=1, state_6=1, var_10=1, var_10_arg_0=1, var_10_arg_1=1, var_10_arg_2=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=1, var_13=15, var_14=0, var_14_arg_0=0, var_14_arg_1=15, var_5=0, var_8=1, var_9=1, var_9_arg_0=0, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=2, var_10_arg_2=1, var_11=2, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=2, var_13=15, var_14=0, var_14_arg_0=1, var_14_arg_1=15, var_5=0, var_8=1, var_9=2, var_9_arg_0=1, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=3, state_6=3, var_10=3, var_10_arg_0=1, var_10_arg_1=3, var_10_arg_2=2, var_11=3, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=3, var_13=15, var_14=0, var_14_arg_0=2, var_14_arg_1=15, var_5=0, var_8=1, var_9=3, var_9_arg_0=2, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=4, state_6=4, var_10=4, var_10_arg_0=1, var_10_arg_1=4, var_10_arg_2=3, var_11=4, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=4, var_13=15, var_14=0, var_14_arg_0=3, var_14_arg_1=15, var_5=0, var_8=1, var_9=4, var_9_arg_0=3, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=5, state_6=5, var_10=5, var_10_arg_0=1, var_10_arg_1=5, var_10_arg_2=4, var_11=5, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=5, var_13=15, var_14=0, var_14_arg_0=4, var_14_arg_1=15, var_5=0, var_8=1, var_9=5, var_9_arg_0=4, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=6, state_6=6, var_10=6, var_10_arg_0=1, var_10_arg_1=6, var_10_arg_2=5, var_11=6, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=6, var_13=15, var_14=0, var_14_arg_0=5, var_14_arg_1=15, var_5=0, var_8=1, var_9=6, var_9_arg_0=5, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=7, state_6=7, var_10=7, var_10_arg_0=1, var_10_arg_1=7, var_10_arg_2=6, var_11=7, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=7, var_13=15, var_14=0, var_14_arg_0=6, var_14_arg_1=15, var_5=0, var_8=1, var_9=7, var_9_arg_0=6, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=8, state_6=8, var_10=8, var_10_arg_0=1, var_10_arg_1=8, var_10_arg_2=7, var_11=8, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=8, var_13=15, var_14=0, var_14_arg_0=7, var_14_arg_1=15, var_5=0, var_8=1, var_9=8, var_9_arg_0=7, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=9, state_6=9, var_10=9, var_10_arg_0=1, var_10_arg_1=9, var_10_arg_2=8, var_11=9, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=9, var_13=15, var_14=0, var_14_arg_0=8, var_14_arg_1=15, var_5=0, var_8=1, var_9=9, var_9_arg_0=8, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=10, state_6=10, var_10=10, var_10_arg_0=1, var_10_arg_1=10, var_10_arg_2=9, var_11=10, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=10, var_13=15, var_14=0, var_14_arg_0=9, var_14_arg_1=15, var_5=0, var_8=1, var_9=10, var_9_arg_0=9, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=11, state_6=11, var_10=11, var_10_arg_0=1, var_10_arg_1=11, var_10_arg_2=10, var_11=11, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=11, var_13=15, var_14=0, var_14_arg_0=10, var_14_arg_1=15, var_5=0, var_8=1, var_9=11, var_9_arg_0=10, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=12, state_6=12, var_10=12, var_10_arg_0=1, var_10_arg_1=12, var_10_arg_2=11, var_11=12, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=12, var_13=15, var_14=0, var_14_arg_0=11, var_14_arg_1=15, var_5=0, var_8=1, var_9=12, var_9_arg_0=11, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=13, state_6=13, var_10=13, var_10_arg_0=1, var_10_arg_1=13, var_10_arg_2=12, var_11=13, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=13, var_13=15, var_14=0, var_14_arg_0=12, var_14_arg_1=15, var_5=0, var_8=1, var_9=13, var_9_arg_0=12, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=14, state_6=14, var_10=14, var_10_arg_0=1, var_10_arg_1=14, var_10_arg_2=13, var_11=14, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=14, var_13=15, var_14=0, var_14_arg_0=13, var_14_arg_1=15, var_5=0, var_8=1, var_9=14, var_9_arg_0=13, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L55] RET __VERIFIER_assert(!(bad_15_arg_0)) [L57] SORT_4 var_9_arg_0 = state_6; [L58] SORT_4 var_9_arg_1 = var_8; [L59] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L60] SORT_1 var_10_arg_0 = input_2; [L61] SORT_4 var_10_arg_1 = var_9; [L62] SORT_4 var_10_arg_2 = state_6; [L63] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L64] SORT_1 var_11_arg_0 = input_3; [L65] SORT_4 var_11_arg_1 = var_5; [L66] SORT_4 var_11_arg_2 = var_10; [L67] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L68] var_11 = var_11 & mask_SORT_4 [L69] SORT_4 next_12_arg_1 = var_11; [L71] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=15, state_6=15, var_10=15, var_10_arg_0=1, var_10_arg_1=15, var_10_arg_2=14, var_11=15, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=15, var_13=15, var_14=0, var_14_arg_0=14, var_14_arg_1=15, var_5=0, var_8=1, var_9=15, var_9_arg_0=14, var_9_arg_1=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_2 = input_2 & mask_SORT_1 [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_14_arg_0 = state_6; [L52] SORT_4 var_14_arg_1 = var_13; [L53] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L54] SORT_1 bad_15_arg_0 = var_14; [L55] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.3s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 17 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 48, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 88051 SizeOfPredicates, 559 NumberOfNonLiveVariables, 946 ConjunctsInSsa, 551 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/564 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-20 20:37:07,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2e28c2b-f0d9-445f-b651-025e1bcbcff3/bin/utaipan-6cKwYrpEi9/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE