./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur --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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- 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-38b53e6 [2022-11-26 01:07:06,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:07:06,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:07:06,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:07:06,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:07:06,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:07:06,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:07:06,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:07:06,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:07:06,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:07:06,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:07:06,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:07:06,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:07:06,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:07:06,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:07:06,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:07:06,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:07:06,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:07:06,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:07:06,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:07:06,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:07:06,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:07:06,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:07:06,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:07:06,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:07:06,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:07:06,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:07:06,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:07:06,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:07:06,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:07:06,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:07:06,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:07:06,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:07:06,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:07:06,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:07:06,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:07:06,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:07:06,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:07:06,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:07:06,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:07:06,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:07:06,199 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 01:07:06,243 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:07:06,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:07:06,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:07:06,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:07:06,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:07:06,245 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:07:06,245 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:07:06,245 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:07:06,246 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:07:06,246 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:07:06,246 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:07:06,246 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:07:06,246 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:07:06,247 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:07:06,247 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:07:06,247 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:07:06,247 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:07:06,248 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:07:06,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:07:06,248 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:07:06,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:07:06,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:07:06,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:07:06,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:07:06,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:07:06,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:07:06,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:07:06,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:07:06,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:07:06,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:07:06,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:07:06,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:07:06,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:07:06,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:07:06,256 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:07:06,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:07:06,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:07:06,258 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:07:06,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:07:06,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:07:06,258 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:07:06,259 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_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/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_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2022-11-26 01:07:06,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:07:06,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:07:06,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:07:06,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:07:06,587 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:07:06,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/loop-invgen/heapsort.i [2022-11-26 01:07:09,648 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:07:09,828 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:07:09,829 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/sv-benchmarks/c/loop-invgen/heapsort.i [2022-11-26 01:07:09,835 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/data/1b096573c/aa505af8441c46e79110350f244566cd/FLAG22cf14833 [2022-11-26 01:07:09,854 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/data/1b096573c/aa505af8441c46e79110350f244566cd [2022-11-26 01:07:09,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:07:09,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:07:09,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:07:09,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:07:09,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:07:09,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15280c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09, skipping insertion in model container [2022-11-26 01:07:09,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:07:09,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:07:10,021 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_66707662-4517-4434-bf36-c9330a949a6e/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-11-26 01:07:10,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:07:10,049 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:07:10,061 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_66707662-4517-4434-bf36-c9330a949a6e/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-11-26 01:07:10,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:07:10,086 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:07:10,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10 WrapperNode [2022-11-26 01:07:10,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:07:10,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:07:10,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:07:10,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:07:10,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,120 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-11-26 01:07:10,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:07:10,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:07:10,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:07:10,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:07:10,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,140 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:07:10,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:07:10,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:07:10,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:07:10,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (1/1) ... [2022-11-26 01:07:10,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:07:10,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:10,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:07:10,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:07:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:07:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:07:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:07:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:07:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-26 01:07:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-26 01:07:10,311 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:07:10,314 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:07:10,545 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:07:10,634 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:07:10,634 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 01:07:10,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:10 BoogieIcfgContainer [2022-11-26 01:07:10,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:07:10,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:07:10,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:07:10,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:07:10,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:07:09" (1/3) ... [2022-11-26 01:07:10,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea65fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:07:10, skipping insertion in model container [2022-11-26 01:07:10,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:10" (2/3) ... [2022-11-26 01:07:10,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea65fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:07:10, skipping insertion in model container [2022-11-26 01:07:10,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:10" (3/3) ... [2022-11-26 01:07:10,662 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-11-26 01:07:10,699 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:07:10,699 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 01:07:10,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:07:10,818 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;@1cb6d7a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:07:10,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 01:07:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-26 01:07:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:07:10,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:10,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:10,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1905704588, now seen corresponding path program 1 times [2022-11-26 01:07:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:10,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636650034] [2022-11-26 01:07:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:11,252 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-26 01:07:11,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:11,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636650034] [2022-11-26 01:07:11,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636650034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:11,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:11,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:07:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620328055] [2022-11-26 01:07:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:11,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:07:11,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:07:11,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:11,319 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:11,476 INFO L93 Difference]: Finished difference Result 93 states and 172 transitions. [2022-11-26 01:07:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:07:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 01:07:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:11,488 INFO L225 Difference]: With dead ends: 93 [2022-11-26 01:07:11,489 INFO L226 Difference]: Without dead ends: 57 [2022-11-26 01:07:11,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-26 01:07:11,500 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 20 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:11,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 172 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-26 01:07:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2022-11-26 01:07:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-26 01:07:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-11-26 01:07:11,560 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 9 [2022-11-26 01:07:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:11,561 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-11-26 01:07:11,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-11-26 01:07:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:07:11,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:11,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:11,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:07:11,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:11,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1900967819, now seen corresponding path program 1 times [2022-11-26 01:07:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:11,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97090977] [2022-11-26 01:07:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:11,744 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-26 01:07:11,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:11,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97090977] [2022-11-26 01:07:11,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97090977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:11,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:11,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:07:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932405385] [2022-11-26 01:07:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:11,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:07:11,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:11,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:07:11,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:11,749 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:11,829 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-11-26 01:07:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:07:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 01:07:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:11,832 INFO L225 Difference]: With dead ends: 43 [2022-11-26 01:07:11,832 INFO L226 Difference]: Without dead ends: 41 [2022-11-26 01:07:11,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-26 01:07:11,834 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:11,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 118 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-26 01:07:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-11-26 01:07:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-26 01:07:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2022-11-26 01:07:11,845 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 9 [2022-11-26 01:07:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:11,846 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2022-11-26 01:07:11,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-11-26 01:07:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:07:11,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:11,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:11,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:07:11,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash -504724405, now seen corresponding path program 1 times [2022-11-26 01:07:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:11,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515964497] [2022-11-26 01:07:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:12,033 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-26 01:07:12,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:12,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515964497] [2022-11-26 01:07:12,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515964497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:12,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:12,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 01:07:12,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185984782] [2022-11-26 01:07:12,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:12,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:07:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:12,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:07:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:12,037 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:12,230 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-11-26 01:07:12,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:07:12,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 01:07:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:12,232 INFO L225 Difference]: With dead ends: 72 [2022-11-26 01:07:12,232 INFO L226 Difference]: Without dead ends: 70 [2022-11-26 01:07:12,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:12,234 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:12,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 163 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-26 01:07:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-11-26 01:07:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-26 01:07:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2022-11-26 01:07:12,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 9 [2022-11-26 01:07:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:12,253 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2022-11-26 01:07:12,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-11-26 01:07:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:07:12,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:12,255 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:12,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:07:12,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash -742689088, now seen corresponding path program 1 times [2022-11-26 01:07:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:12,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948911261] [2022-11-26 01:07:12,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:12,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:12,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948911261] [2022-11-26 01:07:12,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948911261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:12,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:12,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 01:07:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314660152] [2022-11-26 01:07:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:12,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:07:12,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:12,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:07:12,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:12,675 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 01:07:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:12,836 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-11-26 01:07:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:07:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-26 01:07:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:12,838 INFO L225 Difference]: With dead ends: 74 [2022-11-26 01:07:12,838 INFO L226 Difference]: Without dead ends: 72 [2022-11-26 01:07:12,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:12,840 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:12,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 178 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-26 01:07:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-11-26 01:07:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-26 01:07:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2022-11-26 01:07:12,864 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 14 [2022-11-26 01:07:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:12,864 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-11-26 01:07:12,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 01:07:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-11-26 01:07:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:07:12,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:12,865 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:12,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 01:07:12,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash -361326625, now seen corresponding path program 1 times [2022-11-26 01:07:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:12,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436903101] [2022-11-26 01:07:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:13,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436903101] [2022-11-26 01:07:13,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436903101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:13,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:13,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:07:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510032919] [2022-11-26 01:07:13,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:13,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:07:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:13,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:07:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:13,027 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 01:07:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:13,113 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-11-26 01:07:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:07:13,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-26 01:07:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:13,119 INFO L225 Difference]: With dead ends: 77 [2022-11-26 01:07:13,119 INFO L226 Difference]: Without dead ends: 75 [2022-11-26 01:07:13,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-26 01:07:13,127 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:13,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 103 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-26 01:07:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-26 01:07:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-26 01:07:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2022-11-26 01:07:13,172 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 14 [2022-11-26 01:07:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:13,172 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2022-11-26 01:07:13,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 01:07:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2022-11-26 01:07:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:07:13,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:13,180 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:07:13,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1770883895, now seen corresponding path program 1 times [2022-11-26 01:07:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:13,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069176117] [2022-11-26 01:07:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:13,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:13,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069176117] [2022-11-26 01:07:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069176117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:13,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:13,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 01:07:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10718890] [2022-11-26 01:07:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:13,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:07:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:07:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:13,293 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 01:07:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:13,443 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2022-11-26 01:07:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:07:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-26 01:07:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:13,445 INFO L225 Difference]: With dead ends: 81 [2022-11-26 01:07:13,445 INFO L226 Difference]: Without dead ends: 79 [2022-11-26 01:07:13,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:13,448 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:13,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-26 01:07:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-26 01:07:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 44 states have internal predecessors, (52), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-26 01:07:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2022-11-26 01:07:13,489 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 14 [2022-11-26 01:07:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:13,489 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2022-11-26 01:07:13,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 01:07:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2022-11-26 01:07:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:07:13,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:13,496 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:13,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 01:07:13,497 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1597699484, now seen corresponding path program 1 times [2022-11-26 01:07:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:13,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367815332] [2022-11-26 01:07:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:13,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:13,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367815332] [2022-11-26 01:07:13,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367815332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:13,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:13,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 01:07:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821018783] [2022-11-26 01:07:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 01:07:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 01:07:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:13,645 INFO L87 Difference]: Start difference. First operand 79 states and 108 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 01:07:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:13,877 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2022-11-26 01:07:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:07:13,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-26 01:07:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:13,881 INFO L225 Difference]: With dead ends: 122 [2022-11-26 01:07:13,881 INFO L226 Difference]: Without dead ends: 120 [2022-11-26 01:07:13,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-26 01:07:13,884 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 28 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:13,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 149 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:07:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-26 01:07:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-11-26 01:07:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 56 states have internal predecessors, (64), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-26 01:07:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2022-11-26 01:07:13,925 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 14 [2022-11-26 01:07:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:13,926 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2022-11-26 01:07:13,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 01:07:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2022-11-26 01:07:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 01:07:13,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:13,928 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:13,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 01:07:13,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:13,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1057383317, now seen corresponding path program 1 times [2022-11-26 01:07:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:13,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195047983] [2022-11-26 01:07:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 01:07:14,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:14,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195047983] [2022-11-26 01:07:14,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195047983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:14,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:14,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 01:07:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074617250] [2022-11-26 01:07:14,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:14,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:07:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:14,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:07:14,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:14,063 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 01:07:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:14,235 INFO L93 Difference]: Finished difference Result 157 states and 233 transitions. [2022-11-26 01:07:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:07:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-11-26 01:07:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:14,243 INFO L225 Difference]: With dead ends: 157 [2022-11-26 01:07:14,243 INFO L226 Difference]: Without dead ends: 155 [2022-11-26 01:07:14,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:14,245 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:14,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 187 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-26 01:07:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2022-11-26 01:07:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 64 states have (on average 1.265625) internal successors, (81), 69 states have internal predecessors, (81), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-26 01:07:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2022-11-26 01:07:14,287 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 21 [2022-11-26 01:07:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:14,288 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2022-11-26 01:07:14,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 01:07:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2022-11-26 01:07:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 01:07:14,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:14,292 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:14,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 01:07:14,293 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1020128255, now seen corresponding path program 1 times [2022-11-26 01:07:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49844090] [2022-11-26 01:07:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 01:07:14,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:14,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49844090] [2022-11-26 01:07:14,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49844090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:14,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:14,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 01:07:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507707808] [2022-11-26 01:07:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:14,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 01:07:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 01:07:14,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:14,378 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 01:07:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:14,561 INFO L93 Difference]: Finished difference Result 128 states and 179 transitions. [2022-11-26 01:07:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:07:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-26 01:07:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:14,563 INFO L225 Difference]: With dead ends: 128 [2022-11-26 01:07:14,563 INFO L226 Difference]: Without dead ends: 126 [2022-11-26 01:07:14,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-26 01:07:14,566 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:14,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-26 01:07:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-11-26 01:07:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 72 states have internal predecessors, (84), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-26 01:07:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2022-11-26 01:07:14,608 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 23 [2022-11-26 01:07:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:14,608 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2022-11-26 01:07:14,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 01:07:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2022-11-26 01:07:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 01:07:14,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:14,610 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:14,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 01:07:14,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 970924607, now seen corresponding path program 1 times [2022-11-26 01:07:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:14,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120421542] [2022-11-26 01:07:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 01:07:14,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:14,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120421542] [2022-11-26 01:07:14,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120421542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:14,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:14,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 01:07:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477954228] [2022-11-26 01:07:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:14,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 01:07:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:14,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 01:07:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:14,793 INFO L87 Difference]: Start difference. First operand 125 states and 176 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 01:07:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:15,024 INFO L93 Difference]: Finished difference Result 147 states and 207 transitions. [2022-11-26 01:07:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:07:15,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-11-26 01:07:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:15,026 INFO L225 Difference]: With dead ends: 147 [2022-11-26 01:07:15,026 INFO L226 Difference]: Without dead ends: 145 [2022-11-26 01:07:15,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-26 01:07:15,027 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:15,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 136 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:07:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-26 01:07:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2022-11-26 01:07:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 75 states have internal predecessors, (87), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-26 01:07:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2022-11-26 01:07:15,075 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 26 [2022-11-26 01:07:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:15,076 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2022-11-26 01:07:15,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 01:07:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2022-11-26 01:07:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 01:07:15,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:15,077 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:15,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 01:07:15,077 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:15,078 INFO L85 PathProgramCache]: Analyzing trace with hash -989282420, now seen corresponding path program 1 times [2022-11-26 01:07:15,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:15,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925925161] [2022-11-26 01:07:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 01:07:15,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:15,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925925161] [2022-11-26 01:07:15,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925925161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878793766] [2022-11-26 01:07:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:15,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:15,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:15,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:15,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:07:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:15,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 01:07:15,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:07:15,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:07:15,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878793766] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:15,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790298920] [2022-11-26 01:07:15,761 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-26 01:07:15,761 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:15,765 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:15,771 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:15,771 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:15,866 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:16,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1790298920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:16,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:16,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 9, 7] total 19 [2022-11-26 01:07:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816366232] [2022-11-26 01:07:16,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:16,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:07:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:07:16,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:07:16,242 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 01:07:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:16,690 INFO L93 Difference]: Finished difference Result 311 states and 454 transitions. [2022-11-26 01:07:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:07:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-26 01:07:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:16,693 INFO L225 Difference]: With dead ends: 311 [2022-11-26 01:07:16,693 INFO L226 Difference]: Without dead ends: 184 [2022-11-26 01:07:16,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:07:16,695 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:16,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 89 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:07:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-26 01:07:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2022-11-26 01:07:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 77 states have internal predecessors, (89), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-26 01:07:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2022-11-26 01:07:16,763 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 28 [2022-11-26 01:07:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:16,764 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2022-11-26 01:07:16,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 01:07:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2022-11-26 01:07:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:07:16,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:16,765 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:16,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:16,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:16,971 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 606224610, now seen corresponding path program 1 times [2022-11-26 01:07:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:16,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952785479] [2022-11-26 01:07:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-26 01:07:17,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:17,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952785479] [2022-11-26 01:07:17,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952785479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:17,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:17,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-26 01:07:17,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718689062] [2022-11-26 01:07:17,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:17,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 01:07:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 01:07:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:17,110 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-26 01:07:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:17,359 INFO L93 Difference]: Finished difference Result 152 states and 211 transitions. [2022-11-26 01:07:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:07:17,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2022-11-26 01:07:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:17,360 INFO L225 Difference]: With dead ends: 152 [2022-11-26 01:07:17,361 INFO L226 Difference]: Without dead ends: 150 [2022-11-26 01:07:17,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-26 01:07:17,362 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:17,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 122 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-26 01:07:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2022-11-26 01:07:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-26 01:07:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 184 transitions. [2022-11-26 01:07:17,440 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 184 transitions. Word has length 35 [2022-11-26 01:07:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:17,440 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 184 transitions. [2022-11-26 01:07:17,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-26 01:07:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 184 transitions. [2022-11-26 01:07:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-26 01:07:17,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:17,445 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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-26 01:07:17,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 01:07:17,445 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1230275415, now seen corresponding path program 1 times [2022-11-26 01:07:17,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:17,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424976695] [2022-11-26 01:07:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:17,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-26 01:07:17,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:17,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424976695] [2022-11-26 01:07:17,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424976695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:17,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:17,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 01:07:17,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811446145] [2022-11-26 01:07:17,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:17,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:07:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:17,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:07:17,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:17,636 INFO L87 Difference]: Start difference. First operand 135 states and 184 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-26 01:07:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:17,890 INFO L93 Difference]: Finished difference Result 172 states and 238 transitions. [2022-11-26 01:07:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:07:17,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2022-11-26 01:07:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:17,894 INFO L225 Difference]: With dead ends: 172 [2022-11-26 01:07:17,894 INFO L226 Difference]: Without dead ends: 170 [2022-11-26 01:07:17,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:17,895 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 34 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:17,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 246 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-26 01:07:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2022-11-26 01:07:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 90 states have internal predecessors, (102), 53 states have call successors, (53), 15 states have call predecessors, (53), 15 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-11-26 01:07:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2022-11-26 01:07:17,967 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 42 [2022-11-26 01:07:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:17,970 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2022-11-26 01:07:17,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-26 01:07:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2022-11-26 01:07:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-26 01:07:17,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:17,972 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:17,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 01:07:17,972 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1685226397, now seen corresponding path program 1 times [2022-11-26 01:07:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:17,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307408695] [2022-11-26 01:07:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-26 01:07:18,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:18,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307408695] [2022-11-26 01:07:18,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307408695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:18,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625811774] [2022-11-26 01:07:18,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:18,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:18,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:18,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:18,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:07:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:18,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:07:18,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-26 01:07:18,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-26 01:07:18,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625811774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:18,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1839316904] [2022-11-26 01:07:18,274 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-26 01:07:18,274 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:18,274 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:18,275 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:18,275 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:21,905 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 8 for LOIs [2022-11-26 01:07:21,909 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:22,709 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4960#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 01:07:22,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:22,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:22,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-26 01:07:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826746900] [2022-11-26 01:07:22,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:22,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 01:07:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:22,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 01:07:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-11-26 01:07:22,712 INFO L87 Difference]: Start difference. First operand 153 states and 208 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-26 01:07:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:23,553 INFO L93 Difference]: Finished difference Result 383 states and 563 transitions. [2022-11-26 01:07:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:07:23,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 41 [2022-11-26 01:07:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:23,556 INFO L225 Difference]: With dead ends: 383 [2022-11-26 01:07:23,557 INFO L226 Difference]: Without dead ends: 298 [2022-11-26 01:07:23,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 01:07:23,558 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 94 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:23,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 195 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:07:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-26 01:07:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 210. [2022-11-26 01:07:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 120 states have internal predecessors, (140), 83 states have call successors, (83), 15 states have call predecessors, (83), 15 states have return successors, (83), 74 states have call predecessors, (83), 83 states have call successors, (83) [2022-11-26 01:07:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 306 transitions. [2022-11-26 01:07:23,711 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 306 transitions. Word has length 41 [2022-11-26 01:07:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:23,712 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 306 transitions. [2022-11-26 01:07:23,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-26 01:07:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 306 transitions. [2022-11-26 01:07:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-26 01:07:23,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:23,714 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:23,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:23,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-26 01:07:23,919 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1781169230, now seen corresponding path program 1 times [2022-11-26 01:07:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:23,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299910535] [2022-11-26 01:07:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-26 01:07:23,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299910535] [2022-11-26 01:07:23,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299910535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:23,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374787049] [2022-11-26 01:07:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:23,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:23,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:23,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:23,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:07:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:24,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:07:24,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-26 01:07:24,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:24,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374787049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:24,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:24,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-26 01:07:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506633526] [2022-11-26 01:07:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:24,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:07:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:24,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:07:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:24,123 INFO L87 Difference]: Start difference. First operand 210 states and 306 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-26 01:07:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:24,339 INFO L93 Difference]: Finished difference Result 460 states and 681 transitions. [2022-11-26 01:07:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:07:24,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2022-11-26 01:07:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:24,342 INFO L225 Difference]: With dead ends: 460 [2022-11-26 01:07:24,342 INFO L226 Difference]: Without dead ends: 254 [2022-11-26 01:07:24,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:24,344 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:24,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 88 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-26 01:07:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 216. [2022-11-26 01:07:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 123 states have internal predecessors, (146), 83 states have call successors, (83), 15 states have call predecessors, (83), 15 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2022-11-26 01:07:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 312 transitions. [2022-11-26 01:07:24,462 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 312 transitions. Word has length 56 [2022-11-26 01:07:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:24,462 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 312 transitions. [2022-11-26 01:07:24,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-26 01:07:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 312 transitions. [2022-11-26 01:07:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-26 01:07:24,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:24,464 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 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] [2022-11-26 01:07:24,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:24,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 01:07:24,670 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash -545552774, now seen corresponding path program 1 times [2022-11-26 01:07:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:24,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280621376] [2022-11-26 01:07:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-26 01:07:24,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:24,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280621376] [2022-11-26 01:07:24,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280621376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:24,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:24,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 01:07:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243281321] [2022-11-26 01:07:24,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:24,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 01:07:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 01:07:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:24,803 INFO L87 Difference]: Start difference. First operand 216 states and 312 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-26 01:07:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:25,072 INFO L93 Difference]: Finished difference Result 283 states and 422 transitions. [2022-11-26 01:07:25,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:07:25,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 69 [2022-11-26 01:07:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:25,075 INFO L225 Difference]: With dead ends: 283 [2022-11-26 01:07:25,075 INFO L226 Difference]: Without dead ends: 281 [2022-11-26 01:07:25,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-26 01:07:25,076 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 34 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:25,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 194 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:25,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-26 01:07:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 240. [2022-11-26 01:07:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 126 states have (on average 1.246031746031746) internal successors, (157), 134 states have internal predecessors, (157), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (97), 89 states have call predecessors, (97), 97 states have call successors, (97) [2022-11-26 01:07:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 351 transitions. [2022-11-26 01:07:25,209 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 351 transitions. Word has length 69 [2022-11-26 01:07:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:25,210 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 351 transitions. [2022-11-26 01:07:25,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-26 01:07:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 351 transitions. [2022-11-26 01:07:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-26 01:07:25,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:25,211 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:25,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 01:07:25,212 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 805840168, now seen corresponding path program 1 times [2022-11-26 01:07:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:25,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001224557] [2022-11-26 01:07:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-11-26 01:07:25,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001224557] [2022-11-26 01:07:25,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001224557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:25,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:25,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:07:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197876915] [2022-11-26 01:07:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:25,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:25,243 INFO L87 Difference]: Start difference. First operand 240 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-26 01:07:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:25,397 INFO L93 Difference]: Finished difference Result 442 states and 651 transitions. [2022-11-26 01:07:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2022-11-26 01:07:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:25,400 INFO L225 Difference]: With dead ends: 442 [2022-11-26 01:07:25,400 INFO L226 Difference]: Without dead ends: 273 [2022-11-26 01:07:25,401 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-26 01:07:25,401 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:25,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 118 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-26 01:07:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 259. [2022-11-26 01:07:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 139 states have internal predecessors, (162), 111 states have call successors, (111), 16 states have call predecessors, (111), 16 states have return successors, (111), 103 states have call predecessors, (111), 111 states have call successors, (111) [2022-11-26 01:07:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 384 transitions. [2022-11-26 01:07:25,531 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 384 transitions. Word has length 68 [2022-11-26 01:07:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:25,531 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 384 transitions. [2022-11-26 01:07:25,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-26 01:07:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 384 transitions. [2022-11-26 01:07:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-26 01:07:25,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:25,533 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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] [2022-11-26 01:07:25,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 01:07:25,534 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2068450044, now seen corresponding path program 1 times [2022-11-26 01:07:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:25,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631216972] [2022-11-26 01:07:25,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-11-26 01:07:25,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:25,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631216972] [2022-11-26 01:07:25,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631216972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:25,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098828129] [2022-11-26 01:07:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:25,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:25,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:25,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:25,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:07:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:25,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-26 01:07:25,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-26 01:07:26,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-11-26 01:07:26,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098828129] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:26,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:07:26,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 12] total 23 [2022-11-26 01:07:26,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513797587] [2022-11-26 01:07:26,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:26,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 01:07:26,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:26,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 01:07:26,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-11-26 01:07:26,943 INFO L87 Difference]: Start difference. First operand 259 states and 384 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-26 01:07:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:27,153 INFO L93 Difference]: Finished difference Result 265 states and 389 transitions. [2022-11-26 01:07:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:07:27,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 75 [2022-11-26 01:07:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:27,155 INFO L225 Difference]: With dead ends: 265 [2022-11-26 01:07:27,155 INFO L226 Difference]: Without dead ends: 263 [2022-11-26 01:07:27,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-11-26 01:07:27,156 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:27,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-26 01:07:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2022-11-26 01:07:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 138 states have internal predecessors, (162), 109 states have call successors, (109), 16 states have call predecessors, (109), 16 states have return successors, (109), 102 states have call predecessors, (109), 109 states have call successors, (109) [2022-11-26 01:07:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 380 transitions. [2022-11-26 01:07:27,297 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 380 transitions. Word has length 75 [2022-11-26 01:07:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:27,298 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 380 transitions. [2022-11-26 01:07:27,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-26 01:07:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 380 transitions. [2022-11-26 01:07:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-26 01:07:27,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:27,300 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 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] [2022-11-26 01:07:27,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:27,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 01:07:27,510 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 215528780, now seen corresponding path program 1 times [2022-11-26 01:07:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:27,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669841052] [2022-11-26 01:07:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-26 01:07:27,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:27,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669841052] [2022-11-26 01:07:27,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669841052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:27,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299804364] [2022-11-26 01:07:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:27,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:27,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:27,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:27,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:07:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:27,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:07:27,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-26 01:07:27,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-26 01:07:27,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299804364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [915640434] [2022-11-26 01:07:27,946 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-26 01:07:27,946 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:27,947 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:27,947 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:27,947 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:29,728 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2022-11-26 01:07:29,761 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:30,717 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10804#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 01:07:30,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:30,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:30,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-11-26 01:07:30,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112885929] [2022-11-26 01:07:30,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:30,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 01:07:30,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:30,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 01:07:30,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2022-11-26 01:07:30,720 INFO L87 Difference]: Start difference. First operand 257 states and 380 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-26 01:07:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:31,110 INFO L93 Difference]: Finished difference Result 283 states and 415 transitions. [2022-11-26 01:07:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:07:31,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 77 [2022-11-26 01:07:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:31,113 INFO L225 Difference]: With dead ends: 283 [2022-11-26 01:07:31,113 INFO L226 Difference]: Without dead ends: 281 [2022-11-26 01:07:31,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2022-11-26 01:07:31,114 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 45 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:31,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 227 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:07:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-26 01:07:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 261. [2022-11-26 01:07:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 141 states have internal predecessors, (165), 109 states have call successors, (109), 17 states have call predecessors, (109), 17 states have return successors, (109), 102 states have call predecessors, (109), 109 states have call successors, (109) [2022-11-26 01:07:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 383 transitions. [2022-11-26 01:07:31,288 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 383 transitions. Word has length 77 [2022-11-26 01:07:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:31,289 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 383 transitions. [2022-11-26 01:07:31,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-26 01:07:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 383 transitions. [2022-11-26 01:07:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-26 01:07:31,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:31,291 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 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] [2022-11-26 01:07:31,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 01:07:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:31,502 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:07:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 744962560, now seen corresponding path program 1 times [2022-11-26 01:07:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:31,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031408047] [2022-11-26 01:07:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-11-26 01:07:31,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:31,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031408047] [2022-11-26 01:07:31,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031408047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:31,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179919151] [2022-11-26 01:07:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:31,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:31,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:31,805 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:31,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:07:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:31,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 01:07:31,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-11-26 01:07:31,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-11-26 01:07:32,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179919151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:32,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [293451608] [2022-11-26 01:07:32,087 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-26 01:07:32,087 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:32,088 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:32,088 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:32,088 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:35,302 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 8 for LOIs [2022-11-26 01:07:35,305 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:36,720 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12269#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 01:07:36,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:36,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:36,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2022-11-26 01:07:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462344378] [2022-11-26 01:07:36,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:36,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 01:07:36,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:36,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 01:07:36,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2022-11-26 01:07:36,723 INFO L87 Difference]: Start difference. First operand 261 states and 383 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2022-11-26 01:07:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:37,658 INFO L93 Difference]: Finished difference Result 389 states and 594 transitions. [2022-11-26 01:07:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 01:07:37,659 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) Word has length 98 [2022-11-26 01:07:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:37,659 INFO L225 Difference]: With dead ends: 389 [2022-11-26 01:07:37,659 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 01:07:37,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 268 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2022-11-26 01:07:37,661 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 81 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:37,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 90 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 01:07:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 01:07:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 01:07:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 01:07:37,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2022-11-26 01:07:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:37,664 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 01:07:37,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2022-11-26 01:07:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 01:07:37,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 01:07:37,667 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 01:07:37,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-26 01:07:37,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:37,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 01:08:35,468 WARN L233 SmtUtils]: Spent 56.01s on a formula simplification. DAG size of input: 231 DAG size of output: 230 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 01:10:23,784 WARN L233 SmtUtils]: Spent 1.81m on a formula simplification. DAG size of input: 189 DAG size of output: 188 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 01:11:23,738 WARN L233 SmtUtils]: Spent 59.48s on a formula simplification. DAG size of input: 231 DAG size of output: 230 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 01:13:08,350 WARN L233 SmtUtils]: Spent 1.74m on a formula simplification. DAG size of input: 189 DAG size of output: 188 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 01:13:15,526 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 234 DAG size of output: 226 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 01:13:34,114 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (= 2 (select |#length| 1)) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) (= (select .cse0 1) 0) (<= 1 |ULTIMATE.start_main_~l~0#1|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:13:34,115 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (= 2 (select |#length| 1)) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) (= (select .cse0 1) 0) (<= 1 |ULTIMATE.start_main_~l~0#1|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:13:34,115 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (= 2 (select |#length| 1)) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:13:34,115 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-11-26 01:13:34,116 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (= 2 (select |#length| 1)) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:13:34,116 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse28 (select |#memory_int| 1)) (.cse14 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse25 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse27 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse26 (<= .cse14 |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse13 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= (select .cse28 0) 48)) (.cse19 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse20 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse21 (= (select .cse28 1) 0)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ 2 .cse14) |ULTIMATE.start_main_~r~0#1|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse25 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse25 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse14 |ULTIMATE.start_main_~j~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2022-11-26 01:13:34,116 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (let ((.cse26 (select |#memory_int| 1)) (.cse14 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse25 (<= .cse14 |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse13 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= (select .cse26 0) 48)) (.cse19 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse20 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse21 (= (select .cse26 1) 0)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ 2 .cse14) |ULTIMATE.start_main_~r~0#1|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2022-11-26 01:13:34,116 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-26 01:13:34,117 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse25 (select |#memory_int| 1)) (.cse26 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse12 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse15 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse26)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (= (select |#valid| 2) 1)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (= (select .cse25 0) 48)) (.cse20 (<= (+ |ULTIMATE.start_main_~r~0#1| .cse26 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse21 (= (select .cse25 1) 0)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 .cse15) |ULTIMATE.start_main_~r~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse1 .cse2 (<= .cse15 |ULTIMATE.start_main_~r~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24)))) [2022-11-26 01:13:34,117 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse25 (select |#memory_int| 1)) (.cse26 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse12 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse15 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse26)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (= (select |#valid| 2) 1)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (= (select .cse25 0) 48)) (.cse20 (<= (+ |ULTIMATE.start_main_~r~0#1| .cse26 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse21 (= (select .cse25 1) 0)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 .cse15) |ULTIMATE.start_main_~r~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse1 .cse2 (<= .cse15 |ULTIMATE.start_main_~r~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24)))) [2022-11-26 01:13:34,117 INFO L902 garLoopResultBuilder]: At program point L69(lines 24 70) the Hoare annotation is: true [2022-11-26 01:13:34,117 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-11-26 01:13:34,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 01:13:34,118 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-26 01:13:34,118 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse26 (select |#memory_int| 1)) (.cse14 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse25 (<= .cse14 |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse13 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= (select .cse26 0) 48)) (.cse19 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse20 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse21 (= (select .cse26 1) 0)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ 2 .cse14) |ULTIMATE.start_main_~r~0#1|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2022-11-26 01:13:34,118 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-11-26 01:13:34,119 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse25 (select |#memory_int| 1)) (.cse26 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse12 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse15 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse26)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (= (select |#valid| 2) 1)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (= (select .cse25 0) 48)) (.cse20 (<= (+ |ULTIMATE.start_main_~r~0#1| .cse26 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse21 (= (select .cse25 1) 0)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 .cse15) |ULTIMATE.start_main_~r~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse1 .cse2 (<= .cse15 |ULTIMATE.start_main_~r~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24)))) [2022-11-26 01:13:34,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 01:13:34,119 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse26 (select |#memory_int| 1)) (.cse14 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse25 (<= .cse14 |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse13 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= (select .cse26 0) 48)) (.cse19 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse20 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse21 (= (select .cse26 1) 0)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ 2 .cse14) |ULTIMATE.start_main_~r~0#1|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2022-11-26 01:13:34,119 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse25 (select |#memory_int| 1)) (.cse26 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse12 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse15 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse26)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (= (select |#valid| 2) 1)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (= (select .cse25 0) 48)) (.cse20 (<= (+ |ULTIMATE.start_main_~r~0#1| .cse26 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse21 (= (select .cse25 1) 0)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 .cse15) |ULTIMATE.start_main_~r~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse1 .cse2 (<= .cse15 |ULTIMATE.start_main_~r~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24)))) [2022-11-26 01:13:34,120 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse23 (select |#memory_int| 1)) (.cse24 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse3 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| .cse24)) (.cse5 (= 2 (select |#length| 1))) (.cse6 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse8 (= 9 (select |#length| 2))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse13 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse14 (= (select |#valid| 0) 0)) (.cse15 (= (select |#valid| 2) 1)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (= (select .cse23 0) 48)) (.cse18 (<= (+ |ULTIMATE.start_main_~r~0#1| .cse24 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse19 (= (select .cse23 1) 0)) (.cse20 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse21 (< 0 |#StackHeapBarrier|)) (.cse22 (= |#NULL.base| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse1 .cse2 (<= .cse3 |ULTIMATE.start_main_~r~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ 2 .cse3) |ULTIMATE.start_main_~r~0#1|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse4 .cse5 (<= 2 |ULTIMATE.start_main_~r~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2022-11-26 01:13:34,120 INFO L899 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2022-11-26 01:13:34,120 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 24 70) the Hoare annotation is: (let ((.cse26 (select |#memory_int| 1)) (.cse23 (div |ULTIMATE.start_main_~n~0#1| 2))) (let ((.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse16 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse18 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse24 (<= |ULTIMATE.start_main_~l~0#1| 1)) (.cse25 (< 0 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse6 (= 9 (select |#length| 2))) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (or (= |ULTIMATE.start_main_~l~0#1| .cse23) (<= .cse23 0))) (.cse8 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse9 (= (select |#valid| 1) 1)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse12 (= (select |#valid| 0) 0)) (.cse13 (= (select |#valid| 2) 1)) (.cse14 (= |#NULL.offset| 0)) (.cse15 (= (select .cse26 0) 48)) (.cse17 (= (select .cse26 1) 0)) (.cse19 (< 0 |#StackHeapBarrier|)) (.cse20 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ 2 (* 2 |ULTIMATE.start_main_~l~0#1|)) |ULTIMATE.start_main_~r~0#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_main_~n~0#1| 1000000) .cse13 .cse14 .cse15 (let ((.cse22 (ite (and (not (= (mod |ULTIMATE.start_main_~n~0#1| 2) 0)) (< |ULTIMATE.start_main_~n~0#1| 0)) (+ .cse23 1) .cse23))) (or (and (= |ULTIMATE.start_main_~l~0#1| .cse22) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (and (= (+ |ULTIMATE.start_main_~r~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (= (+ .cse22 1) |ULTIMATE.start_main_~l~0#1|)))) .cse17 (<= |ULTIMATE.start_main_~l~0#1| |ULTIMATE.start_main_~n~0#1|) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse24 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse24 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 1 .cse23) .cse17 .cse19 .cse20)))) [2022-11-26 01:13:34,121 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-26 01:13:34,121 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse28 (select |#memory_int| 1)) (.cse14 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse25 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse27 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse26 (<= .cse14 |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse13 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= (select .cse28 0) 48)) (.cse19 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse20 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse21 (= (select .cse28 1) 0)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ 2 .cse14) |ULTIMATE.start_main_~r~0#1|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse25 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse25 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse14 |ULTIMATE.start_main_~j~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2022-11-26 01:13:34,121 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-11-26 01:13:34,121 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2022-11-26 01:13:34,122 INFO L895 garLoopResultBuilder]: At program point L39-1(lines 39 46) the Hoare annotation is: (let ((.cse28 (select |#memory_int| 1)) (.cse14 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse25 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse27 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse26 (<= .cse14 |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= 9 (select |#length| 2))) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse13 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= (select .cse28 0) 48)) (.cse19 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse20 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse21 (= (select .cse28 1) 0)) (.cse22 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ 2 .cse14) |ULTIMATE.start_main_~r~0#1|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse25 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse25 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse14 |ULTIMATE.start_main_~j~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2022-11-26 01:13:34,122 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-11-26 01:13:34,122 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-11-26 01:13:34,122 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-11-26 01:13:34,122 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-26 01:13:34,122 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-26 01:13:34,123 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-11-26 01:13:34,126 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:13:34,128 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 01:13:34,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:13:34 BoogieIcfgContainer [2022-11-26 01:13:34,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 01:13:34,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 01:13:34,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 01:13:34,157 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 01:13:34,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:10" (3/4) ... [2022-11-26 01:13:34,160 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 01:13:34,166 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-26 01:13:34,170 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-26 01:13:34,170 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-26 01:13:34,170 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 01:13:34,171 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 01:13:34,171 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 01:13:34,195 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((n <= 2147483647 && argv == argv) && argc == \old(argc)) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && 2 + 2 * l <= r) && (1 <= i || j < r)) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((argv == argv && argc == \old(argc)) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && (l == n / 2 || n / 2 <= 0)) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && n <= 1000000) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && ((l == (if !(n % 2 == 0) && n < 0 then n / 2 + 1 else n / 2) && n == r) || (r + 1 == n && (if !(n % 2 == 0) && n < 0 then n / 2 + 1 else n / 2) + 1 == l))) && unknown-#memory_int-unknown[1][1] == 0) && l <= n) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((n <= 2147483647 && argv == argv) && argc == \old(argc)) && l <= 1) && 0 < r) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((argv == argv && argc == \old(argc)) && l <= 1) && 0 < r) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && (l == n / 2 || n / 2 <= 0)) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 1 <= n / 2) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-26 01:13:34,195 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((n <= 2147483647 && l == n / 2) && argv == argv) && argc == \old(argc)) && 2 * l <= r) && j <= 2 * i) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && 2 <= i) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((n <= 2147483647 && argv == argv) && argc == \old(argc)) && j <= 2 * i) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && 2 + 2 * l <= r) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((n <= 2147483647 && argv == argv) && argc == \old(argc)) && l <= 1) && j <= 2 * i) && 2 == unknown-#length-unknown[1]) && 2 <= r) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-26 01:13:34,206 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 01:13:34,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 01:13:34,207 INFO L158 Benchmark]: Toolchain (without parser) took 384346.87ms. Allocated memory was 159.4MB in the beginning and 673.2MB in the end (delta: 513.8MB). Free memory was 115.4MB in the beginning and 297.6MB in the end (delta: -182.2MB). Peak memory consumption was 333.9MB. Max. memory is 16.1GB. [2022-11-26 01:13:34,207 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:13:34,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.92ms. Allocated memory is still 159.4MB. Free memory was 115.4MB in the beginning and 104.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 01:13:34,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.94ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 102.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:13:34,208 INFO L158 Benchmark]: Boogie Preprocessor took 21.27ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 101.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:13:34,209 INFO L158 Benchmark]: RCFGBuilder took 493.49ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 87.8MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-26 01:13:34,209 INFO L158 Benchmark]: TraceAbstraction took 383500.76ms. Allocated memory was 159.4MB in the beginning and 673.2MB in the end (delta: 513.8MB). Free memory was 86.9MB in the beginning and 300.7MB in the end (delta: -213.8MB). Peak memory consumption was 365.4MB. Max. memory is 16.1GB. [2022-11-26 01:13:34,209 INFO L158 Benchmark]: Witness Printer took 49.94ms. Allocated memory is still 673.2MB. Free memory was 300.7MB in the beginning and 297.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 01:13:34,211 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.92ms. Allocated memory is still 159.4MB. Free memory was 115.4MB in the beginning and 104.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.94ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 102.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.27ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 101.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 493.49ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 87.8MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 383500.76ms. Allocated memory was 159.4MB in the beginning and 673.2MB in the end (delta: 513.8MB). Free memory was 86.9MB in the beginning and 300.7MB in the end (delta: -213.8MB). Peak memory consumption was 365.4MB. Max. memory is 16.1GB. * Witness Printer took 49.94ms. Allocated memory is still 673.2MB. Free memory was 300.7MB in the beginning and 297.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 383.3s, OverallIterations: 20, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 356.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 2901 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1845 mSDsCounter, 717 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3205 IncrementalHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 717 mSolverCounterUnsat, 1056 mSDtfsCounter, 3205 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1108 GetRequests, 870 SyntacticMatches, 15 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=19, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 388 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 432 PreInvPairs, 645 NumberOfFragments, 4832 HoareAnnotationTreeSize, 432 FomulaSimplifications, 788494 FormulaSimplificationTreeSizeReduction, 340.6s HoareSimplificationTime, 18 FomulaSimplificationsInter, 4922709 FormulaSimplificationTreeSizeReductionInter, 15.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1405 ConstructedInterpolants, 0 QuantifiedInterpolants, 4427 SizeOfPredicates, 23 NumberOfNonLiveVariables, 912 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 4093/4268 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: OVERALL_TIME: 0.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 6, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 6, TOOLS_POST_TIME: 0.0s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 6, TOOLS_QUANTIFIERELIM_TIME: 0.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 13, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 6, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 93, DAG_COMPRESSION_RETAINED_NODES: 35, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((n <= 2147483647 && argv == argv) && argc == \old(argc)) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && 2 + 2 * l <= r) && (1 <= i || j < r)) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((argv == argv && argc == \old(argc)) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && (l == n / 2 || n / 2 <= 0)) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && n <= 1000000) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && ((l == (if !(n % 2 == 0) && n < 0 then n / 2 + 1 else n / 2) && n == r) || (r + 1 == n && (if !(n % 2 == 0) && n < 0 then n / 2 + 1 else n / 2) + 1 == l))) && unknown-#memory_int-unknown[1][1] == 0) && l <= n) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((n <= 2147483647 && argv == argv) && argc == \old(argc)) && l <= 1) && 0 < r) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((argv == argv && argc == \old(argc)) && l <= 1) && 0 < r) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && (l == n / 2 || n / 2 <= 0)) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 1 <= n / 2) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((n <= 2147483647 && l == n / 2) && argv == argv) && argc == \old(argc)) && 2 * l <= r) && j <= 2 * i) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && 2 <= i) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((n <= 2147483647 && argv == argv) && argc == \old(argc)) && j <= 2 * i) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && 2 + 2 * l <= r) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((n <= 2147483647 && argv == argv) && argc == \old(argc)) && l <= 1) && j <= 2 * i) && 2 == unknown-#length-unknown[1]) && 2 <= r) && r <= n) && argv == #in~argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-26 01:13:34,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66707662-4517-4434-bf36-c9330a949a6e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE