./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfeefe603ac8e9509c0defeafd3f556115c7ef9469dee8e36ba96447893f8761 --- 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-4e7fbc6 [2022-11-23 14:10:56,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:10:56,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:10:56,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:10:56,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:10:56,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:10:56,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:10:56,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:10:56,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:10:56,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:10:56,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:10:56,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:10:56,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:10:56,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:10:56,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:10:56,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:10:56,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:10:56,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:10:56,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:10:56,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:10:56,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:10:56,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:10:56,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:10:56,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:10:56,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:10:56,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:10:56,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:10:56,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:10:56,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:10:56,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:10:56,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:10:56,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:10:56,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:10:56,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:10:56,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:10:56,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:10:56,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:10:56,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:10:56,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:10:56,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:10:56,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:10:56,297 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:10:56,329 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:10:56,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:10:56,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:10:56,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:10:56,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:10:56,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:10:56,331 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:10:56,331 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:10:56,332 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:10:56,332 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:10:56,333 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:10:56,333 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:10:56,333 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:10:56,333 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:10:56,334 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:10:56,334 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:10:56,334 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:10:56,334 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:10:56,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:10:56,335 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:10:56,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:10:56,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:10:56,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:10:56,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:10:56,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:10:56,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:10:56,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:10:56,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:10:56,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:10:56,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:10:56,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:10:56,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:10:56,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:10:56,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:10:56,339 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:10:56,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:10:56,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:10:56,339 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:10:56,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:10:56,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:10:56,340 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:10:56,340 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_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/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_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfeefe603ac8e9509c0defeafd3f556115c7ef9469dee8e36ba96447893f8761 [2022-11-23 14:10:56,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:10:56,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:10:56,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:10:56,691 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:10:56,692 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:10:56,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c [2022-11-23 14:10:59,823 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:11:00,135 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:11:00,136 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/sv-benchmarks/c/eca-rers2012/Problem02_label13.c [2022-11-23 14:11:00,152 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/data/28ebec306/d308ac1e53f54ef981b8df38d2f1ab47/FLAG992348043 [2022-11-23 14:11:00,167 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/data/28ebec306/d308ac1e53f54ef981b8df38d2f1ab47 [2022-11-23 14:11:00,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:11:00,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:11:00,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:11:00,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:11:00,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:11:00,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2378468d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00, skipping insertion in model container [2022-11-23 14:11:00,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:11:00,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:11:00,541 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_402d607c-eb52-4261-b792-ad73b046108e/sv-benchmarks/c/eca-rers2012/Problem02_label13.c[15197,15210] [2022-11-23 14:11:00,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:11:00,602 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:11:00,749 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_402d607c-eb52-4261-b792-ad73b046108e/sv-benchmarks/c/eca-rers2012/Problem02_label13.c[15197,15210] [2022-11-23 14:11:00,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:11:00,797 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:11:00,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00 WrapperNode [2022-11-23 14:11:00,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:11:00,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:11:00,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:11:00,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:11:00,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,882 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-11-23 14:11:00,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:11:00,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:11:00,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:11:00,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:11:00,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,924 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:11:00,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:11:00,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:11:00,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:11:00,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (1/1) ... [2022-11-23 14:11:00,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:11:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:11:00,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:11:00,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:11:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:11:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:11:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:11:01,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:11:01,103 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:11:01,105 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:11:02,205 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:11:02,453 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:11:02,453 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 14:11:02,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:11:02 BoogieIcfgContainer [2022-11-23 14:11:02,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:11:02,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:11:02,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:11:02,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:11:02,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:11:00" (1/3) ... [2022-11-23 14:11:02,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e3f978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:11:02, skipping insertion in model container [2022-11-23 14:11:02,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:11:00" (2/3) ... [2022-11-23 14:11:02,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e3f978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:11:02, skipping insertion in model container [2022-11-23 14:11:02,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:11:02" (3/3) ... [2022-11-23 14:11:02,464 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label13.c [2022-11-23 14:11:02,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:11:02,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 14:11:02,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:11:02,565 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;@6b136673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:11:02,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 14:11:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 84 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-23 14:11:02,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:02,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:02,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1814569940, now seen corresponding path program 1 times [2022-11-23 14:11:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:02,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163396573] [2022-11-23 14:11:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:03,140 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-23 14:11:03,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:03,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163396573] [2022-11-23 14:11:03,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163396573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:03,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:11:03,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:11:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250068526] [2022-11-23 14:11:03,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:03,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:03,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:03,190 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 84 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:03,679 INFO L93 Difference]: Finished difference Result 251 states and 482 transitions. [2022-11-23 14:11:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-23 14:11:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:03,692 INFO L225 Difference]: With dead ends: 251 [2022-11-23 14:11:03,693 INFO L226 Difference]: Without dead ends: 163 [2022-11-23 14:11:03,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:03,705 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:03,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 55 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:11:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-23 14:11:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-11-23 14:11:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.8395061728395061) internal successors, (298), 162 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 298 transitions. [2022-11-23 14:11:03,791 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 298 transitions. Word has length 80 [2022-11-23 14:11:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:03,793 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 298 transitions. [2022-11-23 14:11:03,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2022-11-23 14:11:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-23 14:11:03,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:03,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:03,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:11:03,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash 625142601, now seen corresponding path program 1 times [2022-11-23 14:11:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:03,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933465195] [2022-11-23 14:11:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:11:04,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:04,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933465195] [2022-11-23 14:11:04,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933465195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:04,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:11:04,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:11:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335922526] [2022-11-23 14:11:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:04,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:04,157 INFO L87 Difference]: Start difference. First operand 163 states and 298 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:04,602 INFO L93 Difference]: Finished difference Result 485 states and 891 transitions. [2022-11-23 14:11:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2022-11-23 14:11:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:04,604 INFO L225 Difference]: With dead ends: 485 [2022-11-23 14:11:04,604 INFO L226 Difference]: Without dead ends: 323 [2022-11-23 14:11:04,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:04,606 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:04,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 63 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:11:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-23 14:11:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-23 14:11:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.515527950310559) internal successors, (488), 322 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 488 transitions. [2022-11-23 14:11:04,621 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 488 transitions. Word has length 84 [2022-11-23 14:11:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:04,622 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 488 transitions. [2022-11-23 14:11:04,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 488 transitions. [2022-11-23 14:11:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-23 14:11:04,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:04,625 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:04,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:11:04,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1659820564, now seen corresponding path program 1 times [2022-11-23 14:11:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:04,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587915073] [2022-11-23 14:11:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:11:04,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:04,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587915073] [2022-11-23 14:11:04,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587915073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:04,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:11:04,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:11:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316233110] [2022-11-23 14:11:04,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:04,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:04,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:04,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:04,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:04,871 INFO L87 Difference]: Start difference. First operand 323 states and 488 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:05,321 INFO L93 Difference]: Finished difference Result 805 states and 1271 transitions. [2022-11-23 14:11:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-11-23 14:11:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:05,323 INFO L225 Difference]: With dead ends: 805 [2022-11-23 14:11:05,324 INFO L226 Difference]: Without dead ends: 483 [2022-11-23 14:11:05,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:05,326 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:05,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 139 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:11:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-11-23 14:11:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2022-11-23 14:11:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.4066390041493777) internal successors, (678), 482 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 678 transitions. [2022-11-23 14:11:05,342 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 678 transitions. Word has length 89 [2022-11-23 14:11:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:05,343 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 678 transitions. [2022-11-23 14:11:05,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 678 transitions. [2022-11-23 14:11:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-23 14:11:05,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:05,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:05,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:11:05,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:05,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1787484735, now seen corresponding path program 1 times [2022-11-23 14:11:05,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:05,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003312215] [2022-11-23 14:11:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:11:05,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:05,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003312215] [2022-11-23 14:11:05,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003312215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:11:05,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891776000] [2022-11-23 14:11:05,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:05,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:11:05,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:11:05,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:11:05,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:11:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:05,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:11:05,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:11:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 14:11:05,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:11:05,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891776000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:05,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:11:05,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-11-23 14:11:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318234799] [2022-11-23 14:11:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:05,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:05,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:11:05,862 INFO L87 Difference]: Start difference. First operand 483 states and 678 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:06,270 INFO L93 Difference]: Finished difference Result 1285 states and 1841 transitions. [2022-11-23 14:11:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:06,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 89 [2022-11-23 14:11:06,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:06,275 INFO L225 Difference]: With dead ends: 1285 [2022-11-23 14:11:06,275 INFO L226 Difference]: Without dead ends: 803 [2022-11-23 14:11:06,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:11:06,277 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:06,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:11:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2022-11-23 14:11:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2022-11-23 14:11:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.4064837905236909) internal successors, (1128), 802 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1128 transitions. [2022-11-23 14:11:06,301 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1128 transitions. Word has length 89 [2022-11-23 14:11:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:06,302 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1128 transitions. [2022-11-23 14:11:06,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1128 transitions. [2022-11-23 14:11:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-23 14:11:06,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:06,305 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:06,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:11:06,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:11:06,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:06,513 INFO L85 PathProgramCache]: Analyzing trace with hash -80531786, now seen corresponding path program 1 times [2022-11-23 14:11:06,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:06,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702203060] [2022-11-23 14:11:06,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:11:06,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:06,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702203060] [2022-11-23 14:11:06,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702203060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:06,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:11:06,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:11:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489029939] [2022-11-23 14:11:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:06,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:06,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:06,661 INFO L87 Difference]: Start difference. First operand 803 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:07,081 INFO L93 Difference]: Finished difference Result 2085 states and 2931 transitions. [2022-11-23 14:11:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:07,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-23 14:11:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:07,088 INFO L225 Difference]: With dead ends: 2085 [2022-11-23 14:11:07,093 INFO L226 Difference]: Without dead ends: 1283 [2022-11-23 14:11:07,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:07,097 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:07,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 147 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:11:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-11-23 14:11:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2022-11-23 14:11:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 1.3088923556942278) internal successors, (1678), 1282 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1678 transitions. [2022-11-23 14:11:07,128 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1678 transitions. Word has length 93 [2022-11-23 14:11:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:07,129 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1678 transitions. [2022-11-23 14:11:07,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1678 transitions. [2022-11-23 14:11:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-23 14:11:07,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:07,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:07,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:11:07,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash 940533773, now seen corresponding path program 1 times [2022-11-23 14:11:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:07,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279220477] [2022-11-23 14:11:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:11:07,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:07,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279220477] [2022-11-23 14:11:07,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279220477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:07,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:11:07,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:11:07,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840600299] [2022-11-23 14:11:07,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:07,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:07,221 INFO L87 Difference]: Start difference. First operand 1283 states and 1678 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:07,617 INFO L93 Difference]: Finished difference Result 3045 states and 4101 transitions. [2022-11-23 14:11:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:07,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-11-23 14:11:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:07,623 INFO L225 Difference]: With dead ends: 3045 [2022-11-23 14:11:07,624 INFO L226 Difference]: Without dead ends: 1763 [2022-11-23 14:11:07,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:07,636 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 93 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:07,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 50 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:11:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-11-23 14:11:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2022-11-23 14:11:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 1.290011350737798) internal successors, (2273), 1762 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2273 transitions. [2022-11-23 14:11:07,682 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2273 transitions. Word has length 94 [2022-11-23 14:11:07,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:07,683 INFO L495 AbstractCegarLoop]: Abstraction has 1763 states and 2273 transitions. [2022-11-23 14:11:07,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2273 transitions. [2022-11-23 14:11:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-23 14:11:07,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:07,687 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:11:07,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1872795119, now seen corresponding path program 1 times [2022-11-23 14:11:07,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:07,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278037450] [2022-11-23 14:11:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:11:08,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:08,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278037450] [2022-11-23 14:11:08,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278037450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:11:08,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168808315] [2022-11-23 14:11:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:08,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:11:08,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:11:08,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:11:08,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:11:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:08,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:11:08,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:11:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-23 14:11:08,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:11:08,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168808315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:08,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:11:08,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-23 14:11:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052723080] [2022-11-23 14:11:08,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:08,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:11:08,372 INFO L87 Difference]: Start difference. First operand 1763 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:08,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:08,748 INFO L93 Difference]: Finished difference Result 2645 states and 3465 transitions. [2022-11-23 14:11:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:08,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 113 [2022-11-23 14:11:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:08,758 INFO L225 Difference]: With dead ends: 2645 [2022-11-23 14:11:08,758 INFO L226 Difference]: Without dead ends: 2643 [2022-11-23 14:11:08,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:11:08,760 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:08,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 12 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:11:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2022-11-23 14:11:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1843. [2022-11-23 14:11:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1842 states have (on average 1.3181324647122692) internal successors, (2428), 1842 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2428 transitions. [2022-11-23 14:11:08,809 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2428 transitions. Word has length 113 [2022-11-23 14:11:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:08,810 INFO L495 AbstractCegarLoop]: Abstraction has 1843 states and 2428 transitions. [2022-11-23 14:11:08,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2428 transitions. [2022-11-23 14:11:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-23 14:11:08,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:08,817 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:08,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:11:09,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:11:09,023 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:09,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1486188072, now seen corresponding path program 1 times [2022-11-23 14:11:09,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:09,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089121484] [2022-11-23 14:11:09,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:09,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-23 14:11:09,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:09,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089121484] [2022-11-23 14:11:09,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089121484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:09,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:11:09,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:11:09,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189859046] [2022-11-23 14:11:09,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:09,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:09,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:09,143 INFO L87 Difference]: Start difference. First operand 1843 states and 2428 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:09,510 INFO L93 Difference]: Finished difference Result 3685 states and 4855 transitions. [2022-11-23 14:11:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:09,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 135 [2022-11-23 14:11:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:09,517 INFO L225 Difference]: With dead ends: 3685 [2022-11-23 14:11:09,517 INFO L226 Difference]: Without dead ends: 1843 [2022-11-23 14:11:09,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:11:09,520 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 79 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:09,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 16 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:11:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-23 14:11:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1683. [2022-11-23 14:11:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.2859690844233056) internal successors, (2163), 1682 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2163 transitions. [2022-11-23 14:11:09,569 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2163 transitions. Word has length 135 [2022-11-23 14:11:09,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:09,570 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 2163 transitions. [2022-11-23 14:11:09,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2163 transitions. [2022-11-23 14:11:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-23 14:11:09,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:09,575 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:09,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:11:09,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash 497076514, now seen corresponding path program 1 times [2022-11-23 14:11:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012705655] [2022-11-23 14:11:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-23 14:11:09,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:09,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012705655] [2022-11-23 14:11:09,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012705655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:11:09,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467220112] [2022-11-23 14:11:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:09,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:11:09,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:11:09,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:11:09,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:11:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:10,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:11:10,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:11:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 14:11:10,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:11:10,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467220112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:10,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:11:10,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-23 14:11:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417081911] [2022-11-23 14:11:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:10,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:10,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:11:10,108 INFO L87 Difference]: Start difference. First operand 1683 states and 2163 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:10,466 INFO L93 Difference]: Finished difference Result 3845 states and 5080 transitions. [2022-11-23 14:11:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:10,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 139 [2022-11-23 14:11:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:10,473 INFO L225 Difference]: With dead ends: 3845 [2022-11-23 14:11:10,474 INFO L226 Difference]: Without dead ends: 2163 [2022-11-23 14:11:10,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:11:10,476 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 55 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:10,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 63 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:11:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2022-11-23 14:11:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2083. [2022-11-23 14:11:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2082 states have (on average 1.2574447646493756) internal successors, (2618), 2082 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2618 transitions. [2022-11-23 14:11:10,522 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2618 transitions. Word has length 139 [2022-11-23 14:11:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:10,523 INFO L495 AbstractCegarLoop]: Abstraction has 2083 states and 2618 transitions. [2022-11-23 14:11:10,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2618 transitions. [2022-11-23 14:11:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-23 14:11:10,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:10,528 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:10,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:11:10,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 14:11:10,733 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1872842407, now seen corresponding path program 1 times [2022-11-23 14:11:10,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:10,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814842458] [2022-11-23 14:11:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-23 14:11:11,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:11,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814842458] [2022-11-23 14:11:11,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814842458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:11:11,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961112581] [2022-11-23 14:11:11,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:11,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:11:11,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:11:11,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:11:11,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:11:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:11,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:11:11,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:11:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-23 14:11:11,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:11:11,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961112581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:11:11,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:11:11,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-23 14:11:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875812868] [2022-11-23 14:11:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:11:11,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:11:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:11:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:11:11,292 INFO L87 Difference]: Start difference. First operand 2083 states and 2618 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:11,634 INFO L93 Difference]: Finished difference Result 4005 states and 5065 transitions. [2022-11-23 14:11:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:11:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-11-23 14:11:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:11,640 INFO L225 Difference]: With dead ends: 4005 [2022-11-23 14:11:11,640 INFO L226 Difference]: Without dead ends: 1843 [2022-11-23 14:11:11,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:11:11,643 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 70 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:11,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 145 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:11:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-23 14:11:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1843. [2022-11-23 14:11:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1842 states have (on average 1.221498371335505) internal successors, (2250), 1842 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2250 transitions. [2022-11-23 14:11:11,714 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2250 transitions. Word has length 154 [2022-11-23 14:11:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:11,714 INFO L495 AbstractCegarLoop]: Abstraction has 1843 states and 2250 transitions. [2022-11-23 14:11:11,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:11:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2250 transitions. [2022-11-23 14:11:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-23 14:11:11,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:11,719 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:11,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-23 14:11:11,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 14:11:11,925 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:11:11,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash -464491831, now seen corresponding path program 1 times [2022-11-23 14:11:11,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:11,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990913851] [2022-11-23 14:11:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:11:11,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:11:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:11:12,052 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 14:11:12,052 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:11:12,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 14:11:12,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:11:12,058 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:11:12,062 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:11:12,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:11:12 BoogieIcfgContainer [2022-11-23 14:11:12,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:11:12,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:11:12,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:11:12,181 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:11:12,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:11:02" (3/4) ... [2022-11-23 14:11:12,183 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 14:11:12,312 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:11:12,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:11:12,313 INFO L158 Benchmark]: Toolchain (without parser) took 12142.36ms. Allocated memory was 132.1MB in the beginning and 239.1MB in the end (delta: 107.0MB). Free memory was 93.8MB in the beginning and 125.3MB in the end (delta: -31.5MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2022-11-23 14:11:12,314 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 132.1MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:11:12,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.06ms. Allocated memory is still 132.1MB. Free memory was 93.3MB in the beginning and 67.0MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-23 14:11:12,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.80ms. Allocated memory is still 132.1MB. Free memory was 67.0MB in the beginning and 61.1MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 14:11:12,315 INFO L158 Benchmark]: Boogie Preprocessor took 50.14ms. Allocated memory is still 132.1MB. Free memory was 61.1MB in the beginning and 56.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 14:11:12,315 INFO L158 Benchmark]: RCFGBuilder took 1521.49ms. Allocated memory is still 132.1MB. Free memory was 56.9MB in the beginning and 44.2MB in the end (delta: 12.7MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-11-23 14:11:12,315 INFO L158 Benchmark]: TraceAbstraction took 9722.02ms. Allocated memory was 132.1MB in the beginning and 239.1MB in the end (delta: 107.0MB). Free memory was 43.5MB in the beginning and 142.0MB in the end (delta: -98.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-11-23 14:11:12,316 INFO L158 Benchmark]: Witness Printer took 132.65ms. Allocated memory is still 239.1MB. Free memory was 142.0MB in the beginning and 125.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 14:11:12,317 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.22ms. Allocated memory is still 132.1MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.06ms. Allocated memory is still 132.1MB. Free memory was 93.3MB in the beginning and 67.0MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.80ms. Allocated memory is still 132.1MB. Free memory was 67.0MB in the beginning and 61.1MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.14ms. Allocated memory is still 132.1MB. Free memory was 61.1MB in the beginning and 56.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1521.49ms. Allocated memory is still 132.1MB. Free memory was 56.9MB in the beginning and 44.2MB in the end (delta: 12.7MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9722.02ms. Allocated memory was 132.1MB in the beginning and 239.1MB in the end (delta: 107.0MB). Free memory was 43.5MB in the beginning and 142.0MB in the end (delta: -98.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 132.65ms. Allocated memory is still 239.1MB. Free memory was 142.0MB in the beginning and 125.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 440]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L175] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L176] a25 = 1 [L177] a28 = 9 [L178] return 26; VAL [\result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L378] COND TRUE ((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))) [L379] a11 = 1 [L380] a19 = 0 [L381] a25 = 1 [L382] a17 = 7 [L383] a28 = 9 [L384] return -1; VAL [\result=-1, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, unknown-#in~input-unknown=5, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L439] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] [L440] reach_error() VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, unknown-#in~input-unknown=3, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 643 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 643 mSDsluCounter, 710 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 635 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2460 IncrementalHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 635 mSolverCounterUnsat, 651 mSDtfsCounter, 2460 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2083occurred in iteration=9, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1040 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1743 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1551 ConstructedInterpolants, 0 QuantifiedInterpolants, 3944 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1095 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 693/725 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-23 14:11:12,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402d607c-eb52-4261-b792-ad73b046108e/bin/utaipan-Q6hlc19bkW/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