./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 11:49:22,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:49:22,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:49:22,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:49:22,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:49:22,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:49:22,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:49:22,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:49:22,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:49:22,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:49:22,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:49:22,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:49:22,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:49:22,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:49:22,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:49:22,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:49:22,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:49:22,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:49:22,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:49:22,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:49:22,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:49:22,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:49:22,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:49:22,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:49:22,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:49:22,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:49:22,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:49:22,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:49:22,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:49:22,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:49:22,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:49:22,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:49:22,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:49:22,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:49:22,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:49:22,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:49:22,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:49:22,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:49:22,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:49:22,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:49:22,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:49:22,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 11:49:22,638 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:49:22,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:49:22,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:49:22,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:49:22,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:49:22,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:49:22,639 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:49:22,639 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:49:22,639 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:49:22,639 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:49:22,639 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:49:22,639 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:49:22,640 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:49:22,640 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:49:22,640 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:49:22,640 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:49:22,640 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:49:22,640 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:49:22,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:49:22,641 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:49:22,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:49:22,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:49:22,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:49:22,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:49:22,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:49:22,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:49:22,642 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:49:22,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:49:22,642 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:49:22,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:49:22,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:49:22,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:49:22,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:49:22,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:49:22,643 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:49:22,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:49:22,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:49:22,643 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:49:22,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:49:22,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:49:22,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:49:22,643 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_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/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_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh 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-12-14 11:49:22,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:49:22,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:49:22,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:49:22,826 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:49:22,827 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:49:22,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/loop-invgen/heapsort.i [2022-12-14 11:49:25,359 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:49:25,519 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:49:25,519 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/sv-benchmarks/c/loop-invgen/heapsort.i [2022-12-14 11:49:25,524 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/data/12437e884/4de2ce21810f4ac4b8f4bb9c482feadc/FLAGb30bd51d2 [2022-12-14 11:49:25,924 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/data/12437e884/4de2ce21810f4ac4b8f4bb9c482feadc [2022-12-14 11:49:25,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:49:25,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:49:25,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:49:25,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:49:25,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:49:25,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:49:25" (1/1) ... [2022-12-14 11:49:25,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579173e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:25, skipping insertion in model container [2022-12-14 11:49:25,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:49:25" (1/1) ... [2022-12-14 11:49:25,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:49:25,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:49:26,095 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_2a473ef4-51c5-496f-a594-857e84c737c9/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-12-14 11:49:26,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:49:26,120 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:49:26,132 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_2a473ef4-51c5-496f-a594-857e84c737c9/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-12-14 11:49:26,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:49:26,152 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:49:26,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26 WrapperNode [2022-12-14 11:49:26,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:49:26,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:49:26,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:49:26,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:49:26,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,184 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-12-14 11:49:26,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:49:26,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:49:26,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:49:26,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:49:26,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,203 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:49:26,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:49:26,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:49:26,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:49:26,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (1/1) ... [2022-12-14 11:49:26,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:49:26,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:26,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:49:26,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:49:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:49:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:49:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:49:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:49:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 11:49:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 11:49:26,327 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:49:26,328 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:49:26,438 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:49:26,464 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:49:26,464 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 11:49:26,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:49:26 BoogieIcfgContainer [2022-12-14 11:49:26,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:49:26,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:49:26,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:49:26,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:49:26,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:49:25" (1/3) ... [2022-12-14 11:49:26,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ba93f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:49:26, skipping insertion in model container [2022-12-14 11:49:26,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:26" (2/3) ... [2022-12-14 11:49:26,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ba93f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:49:26, skipping insertion in model container [2022-12-14 11:49:26,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:49:26" (3/3) ... [2022-12-14 11:49:26,473 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-12-14 11:49:26,488 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:49:26,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:49:26,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:49:26,531 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;@3c34d8de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:49:26,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 11:49:26,535 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-12-14 11:49:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 11:49:26,540 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:26,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:26,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1905704588, now seen corresponding path program 1 times [2022-12-14 11:49:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:26,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712798269] [2022-12-14 11:49:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:26,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:26,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712798269] [2022-12-14 11:49:26,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712798269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:26,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:26,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:49:26,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407539193] [2022-12-14 11:49:26,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:26,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:49:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:26,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:49:26,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:49:26,800 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-12-14 11:49:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:26,920 INFO L93 Difference]: Finished difference Result 93 states and 172 transitions. [2022-12-14 11:49:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:49:26,922 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-12-14 11:49:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:26,929 INFO L225 Difference]: With dead ends: 93 [2022-12-14 11:49:26,929 INFO L226 Difference]: Without dead ends: 57 [2022-12-14 11:49:26,931 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-12-14 11:49:26,935 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-12-14 11:49:26,936 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-12-14 11:49:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-14 11:49:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2022-12-14 11:49:26,971 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-12-14 11:49:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-12-14 11:49:26,973 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 9 [2022-12-14 11:49:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:26,973 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-12-14 11:49:26,974 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-12-14 11:49:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-12-14 11:49:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 11:49:26,974 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:26,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:26,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:49:26,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1900967819, now seen corresponding path program 1 times [2022-12-14 11:49:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:26,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474363451] [2022-12-14 11:49:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:27,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474363451] [2022-12-14 11:49:27,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474363451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:27,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:27,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:49:27,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164440246] [2022-12-14 11:49:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:27,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:49:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:49:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:49:27,081 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-12-14 11:49:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:27,143 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-12-14 11:49:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:49:27,144 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-12-14 11:49:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:27,145 INFO L225 Difference]: With dead ends: 43 [2022-12-14 11:49:27,145 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 11:49:27,146 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-12-14 11:49:27,147 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:27,147 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.0s Time] [2022-12-14 11:49:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 11:49:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-12-14 11:49:27,156 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-12-14 11:49:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2022-12-14 11:49:27,157 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 9 [2022-12-14 11:49:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:27,158 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2022-12-14 11:49:27,158 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-12-14 11:49:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-12-14 11:49:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 11:49:27,159 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:27,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:27,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:49:27,159 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash -504724405, now seen corresponding path program 1 times [2022-12-14 11:49:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:27,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690325542] [2022-12-14 11:49:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:27,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:27,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690325542] [2022-12-14 11:49:27,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690325542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:27,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:27,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:49:27,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645910508] [2022-12-14 11:49:27,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:27,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:49:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:27,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:49:27,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:49:27,291 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-12-14 11:49:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:27,434 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-12-14 11:49:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:49:27,434 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-12-14 11:49:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:27,436 INFO L225 Difference]: With dead ends: 72 [2022-12-14 11:49:27,436 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 11:49:27,436 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-12-14 11:49:27,437 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-12-14 11:49:27,438 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-12-14 11:49:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 11:49:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-12-14 11:49:27,451 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-12-14 11:49:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2022-12-14 11:49:27,453 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 9 [2022-12-14 11:49:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:27,453 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2022-12-14 11:49:27,453 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-12-14 11:49:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-12-14 11:49:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:49:27,454 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:27,454 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:27,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:49:27,455 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash -742689088, now seen corresponding path program 1 times [2022-12-14 11:49:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:27,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348561003] [2022-12-14 11:49:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:27,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:27,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348561003] [2022-12-14 11:49:27,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348561003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:27,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:27,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:49:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930209366] [2022-12-14 11:49:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:27,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:49:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:49:27,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:49:27,723 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-12-14 11:49:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:27,842 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-12-14 11:49:27,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:49:27,842 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-12-14 11:49:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:27,843 INFO L225 Difference]: With dead ends: 74 [2022-12-14 11:49:27,843 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 11:49:27,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:49:27,844 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-12-14 11:49:27,844 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-12-14 11:49:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 11:49:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-12-14 11:49:27,857 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-12-14 11:49:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2022-12-14 11:49:27,858 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 14 [2022-12-14 11:49:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:27,858 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-12-14 11:49:27,858 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-12-14 11:49:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-12-14 11:49:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:49:27,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:27,859 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:27,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:49:27,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash -361326625, now seen corresponding path program 1 times [2022-12-14 11:49:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:27,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415099883] [2022-12-14 11:49:27,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:27,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:27,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:27,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415099883] [2022-12-14 11:49:27,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415099883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:27,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:27,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:49:27,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706352113] [2022-12-14 11:49:27,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:27,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:49:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:27,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:49:27,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:49:27,904 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-12-14 11:49:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:27,964 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-12-14 11:49:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:49:27,964 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-12-14 11:49:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:27,966 INFO L225 Difference]: With dead ends: 77 [2022-12-14 11:49:27,966 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 11:49:27,967 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-12-14 11:49:27,968 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-12-14 11:49:27,969 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-12-14 11:49:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 11:49:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-12-14 11:49:27,989 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-12-14 11:49:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2022-12-14 11:49:27,990 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 14 [2022-12-14 11:49:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:27,990 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2022-12-14 11:49:27,990 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-12-14 11:49:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2022-12-14 11:49:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:49:27,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:27,991 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:27,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:49:27,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1770883895, now seen corresponding path program 1 times [2022-12-14 11:49:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:27,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354476678] [2022-12-14 11:49:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:28,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:28,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354476678] [2022-12-14 11:49:28,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354476678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:28,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:28,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:49:28,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592051642] [2022-12-14 11:49:28,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:28,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:49:28,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:28,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:49:28,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:49:28,060 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-12-14 11:49:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:28,164 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2022-12-14 11:49:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:49:28,164 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-12-14 11:49:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:28,165 INFO L225 Difference]: With dead ends: 81 [2022-12-14 11:49:28,165 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 11:49:28,165 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-12-14 11:49:28,166 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-12-14 11:49:28,166 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-12-14 11:49:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 11:49:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-12-14 11:49:28,178 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-12-14 11:49:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2022-12-14 11:49:28,179 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 14 [2022-12-14 11:49:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:28,179 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2022-12-14 11:49:28,179 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-12-14 11:49:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2022-12-14 11:49:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:49:28,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:28,180 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:28,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:49:28,180 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1597699484, now seen corresponding path program 1 times [2022-12-14 11:49:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:28,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341964157] [2022-12-14 11:49:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:28,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:28,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341964157] [2022-12-14 11:49:28,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341964157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:28,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:28,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:49:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093460824] [2022-12-14 11:49:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:28,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:49:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:28,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:49:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:49:28,239 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-12-14 11:49:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:28,389 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2022-12-14 11:49:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:49:28,389 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-12-14 11:49:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:28,391 INFO L225 Difference]: With dead ends: 122 [2022-12-14 11:49:28,391 INFO L226 Difference]: Without dead ends: 120 [2022-12-14 11:49:28,392 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-12-14 11:49:28,393 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:28,393 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.1s Time] [2022-12-14 11:49:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-14 11:49:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-12-14 11:49:28,418 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-12-14 11:49:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2022-12-14 11:49:28,419 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 14 [2022-12-14 11:49:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:28,420 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2022-12-14 11:49:28,420 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-12-14 11:49:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2022-12-14 11:49:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 11:49:28,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:28,421 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:28,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:49:28,421 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:28,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1057383317, now seen corresponding path program 1 times [2022-12-14 11:49:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:28,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28927196] [2022-12-14 11:49:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:49:28,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:28,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28927196] [2022-12-14 11:49:28,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28927196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:28,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:28,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:49:28,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832843257] [2022-12-14 11:49:28,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:28,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:49:28,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:28,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:49:28,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:49:28,491 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-12-14 11:49:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:28,605 INFO L93 Difference]: Finished difference Result 157 states and 233 transitions. [2022-12-14 11:49:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:49:28,606 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-12-14 11:49:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:28,607 INFO L225 Difference]: With dead ends: 157 [2022-12-14 11:49:28,607 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 11:49:28,608 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-12-14 11:49:28,608 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-12-14 11:49:28,609 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-12-14 11:49:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 11:49:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2022-12-14 11:49:28,637 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-12-14 11:49:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2022-12-14 11:49:28,639 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 21 [2022-12-14 11:49:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:28,639 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2022-12-14 11:49:28,639 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-12-14 11:49:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2022-12-14 11:49:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:49:28,640 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:28,640 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:28,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:49:28,641 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1020128255, now seen corresponding path program 1 times [2022-12-14 11:49:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:28,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988464629] [2022-12-14 11:49:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:49:28,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:28,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988464629] [2022-12-14 11:49:28,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988464629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:28,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:28,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:49:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021450293] [2022-12-14 11:49:28,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:28,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:49:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:49:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:49:28,701 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-12-14 11:49:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:28,821 INFO L93 Difference]: Finished difference Result 128 states and 179 transitions. [2022-12-14 11:49:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:49:28,822 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-12-14 11:49:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:28,823 INFO L225 Difference]: With dead ends: 128 [2022-12-14 11:49:28,823 INFO L226 Difference]: Without dead ends: 126 [2022-12-14 11:49:28,824 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-12-14 11:49:28,824 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-12-14 11:49:28,825 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-12-14 11:49:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-14 11:49:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-12-14 11:49:28,852 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-12-14 11:49:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2022-12-14 11:49:28,854 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 23 [2022-12-14 11:49:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:28,854 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2022-12-14 11:49:28,854 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-12-14 11:49:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2022-12-14 11:49:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 11:49:28,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:28,855 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-12-14 11:49:28,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 11:49:28,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:28,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash 970924607, now seen corresponding path program 1 times [2022-12-14 11:49:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:28,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926423340] [2022-12-14 11:49:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:28,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 11:49:28,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:28,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926423340] [2022-12-14 11:49:28,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926423340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:28,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:28,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:49:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688225630] [2022-12-14 11:49:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:28,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:49:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:28,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:49:28,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:49:28,948 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-12-14 11:49:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:29,110 INFO L93 Difference]: Finished difference Result 147 states and 207 transitions. [2022-12-14 11:49:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:49:29,110 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-12-14 11:49:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:29,112 INFO L225 Difference]: With dead ends: 147 [2022-12-14 11:49:29,112 INFO L226 Difference]: Without dead ends: 145 [2022-12-14 11:49:29,112 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-12-14 11:49:29,113 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:29,113 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.1s Time] [2022-12-14 11:49:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-14 11:49:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2022-12-14 11:49:29,147 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-12-14 11:49:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2022-12-14 11:49:29,148 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 26 [2022-12-14 11:49:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:29,149 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2022-12-14 11:49:29,149 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-12-14 11:49:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2022-12-14 11:49:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:49:29,150 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:29,150 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:29,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 11:49:29,150 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash -989282420, now seen corresponding path program 1 times [2022-12-14 11:49:29,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:29,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559256048] [2022-12-14 11:49:29,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 11:49:29,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:29,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559256048] [2022-12-14 11:49:29,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559256048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087889604] [2022-12-14 11:49:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:29,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:29,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:29,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:29,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:49:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:29,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 11:49:29,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:49:29,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:49:29,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087889604] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:29,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [72836731] [2022-12-14 11:49:29,605 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-12-14 11:49:29,605 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:29,609 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:29,615 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:29,615 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:29,688 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:29,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [72836731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:29,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:29,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 9, 7] total 19 [2022-12-14 11:49:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445849804] [2022-12-14 11:49:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:29,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:49:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:49:29,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-14 11:49:29,948 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-12-14 11:49:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:30,285 INFO L93 Difference]: Finished difference Result 311 states and 454 transitions. [2022-12-14 11:49:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:49:30,285 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-12-14 11:49:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:30,287 INFO L225 Difference]: With dead ends: 311 [2022-12-14 11:49:30,287 INFO L226 Difference]: Without dead ends: 184 [2022-12-14 11:49:30,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-14 11:49:30,288 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12-14 11:49:30,288 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-12-14 11:49:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-12-14 11:49:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2022-12-14 11:49:30,327 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-12-14 11:49:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2022-12-14 11:49:30,327 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 28 [2022-12-14 11:49:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:30,328 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2022-12-14 11:49:30,328 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-12-14 11:49:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2022-12-14 11:49:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 11:49:30,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:30,328 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-12-14 11:49:30,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:49:30,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:30,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:30,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash 606224610, now seen corresponding path program 1 times [2022-12-14 11:49:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:30,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071705972] [2022-12-14 11:49:30,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:30,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 11:49:30,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:30,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071705972] [2022-12-14 11:49:30,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071705972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:30,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:30,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:49:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927839355] [2022-12-14 11:49:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:30,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:49:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:30,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:49:30,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:49:30,625 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-12-14 11:49:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:30,801 INFO L93 Difference]: Finished difference Result 152 states and 211 transitions. [2022-12-14 11:49:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:49:30,802 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-12-14 11:49:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:30,803 INFO L225 Difference]: With dead ends: 152 [2022-12-14 11:49:30,803 INFO L226 Difference]: Without dead ends: 150 [2022-12-14 11:49:30,804 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-12-14 11:49:30,804 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-12-14 11:49:30,805 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-12-14 11:49:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-14 11:49:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2022-12-14 11:49:30,850 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-12-14 11:49:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 184 transitions. [2022-12-14 11:49:30,854 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 184 transitions. Word has length 35 [2022-12-14 11:49:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:30,854 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 184 transitions. [2022-12-14 11:49:30,855 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-12-14 11:49:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 184 transitions. [2022-12-14 11:49:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 11:49:30,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:30,855 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-12-14 11:49:30,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 11:49:30,856 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1230275415, now seen corresponding path program 1 times [2022-12-14 11:49:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:30,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499870801] [2022-12-14 11:49:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 11:49:30,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:30,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499870801] [2022-12-14 11:49:30,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499870801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:30,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:30,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:49:30,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117612704] [2022-12-14 11:49:30,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:30,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:49:30,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:30,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:49:30,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:49:30,951 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-12-14 11:49:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:31,128 INFO L93 Difference]: Finished difference Result 172 states and 238 transitions. [2022-12-14 11:49:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:49:31,128 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-12-14 11:49:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:31,130 INFO L225 Difference]: With dead ends: 172 [2022-12-14 11:49:31,130 INFO L226 Difference]: Without dead ends: 170 [2022-12-14 11:49:31,130 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-12-14 11:49:31,131 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-12-14 11:49:31,131 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-12-14 11:49:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-14 11:49:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2022-12-14 11:49:31,171 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-12-14 11:49:31,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2022-12-14 11:49:31,172 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 42 [2022-12-14 11:49:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:31,172 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2022-12-14 11:49:31,172 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-12-14 11:49:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2022-12-14 11:49:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 11:49:31,173 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:31,173 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-12-14 11:49:31,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 11:49:31,173 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1685226397, now seen corresponding path program 1 times [2022-12-14 11:49:31,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:31,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602542084] [2022-12-14 11:49:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 11:49:31,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:31,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602542084] [2022-12-14 11:49:31,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602542084] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:31,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988694891] [2022-12-14 11:49:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:31,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:31,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:31,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:31,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:49:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:31,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 11:49:31,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 11:49:31,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 11:49:31,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988694891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:31,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1630034529] [2022-12-14 11:49:31,337 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-12-14 11:49:31,337 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:31,337 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:31,337 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:31,337 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:33,917 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 8 for LOIs [2022-12-14 11:49:33,921 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:34,455 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-12-14 11:49:34,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:49:34,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:34,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-14 11:49:34,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147135277] [2022-12-14 11:49:34,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:34,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:49:34,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:34,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:49:34,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-12-14 11:49:34,457 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-12-14 11:49:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:35,041 INFO L93 Difference]: Finished difference Result 383 states and 563 transitions. [2022-12-14 11:49:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 11:49:35,042 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-12-14 11:49:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:35,044 INFO L225 Difference]: With dead ends: 383 [2022-12-14 11:49:35,044 INFO L226 Difference]: Without dead ends: 298 [2022-12-14 11:49:35,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 11:49:35,045 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 94 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:35,045 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.4s Time] [2022-12-14 11:49:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-12-14 11:49:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 210. [2022-12-14 11:49:35,104 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-12-14 11:49:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 306 transitions. [2022-12-14 11:49:35,105 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 306 transitions. Word has length 41 [2022-12-14 11:49:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:35,105 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 306 transitions. [2022-12-14 11:49:35,105 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-12-14 11:49:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 306 transitions. [2022-12-14 11:49:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 11:49:35,106 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:35,106 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-12-14 11:49:35,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 11:49:35,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 11:49:35,308 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1781169230, now seen corresponding path program 1 times [2022-12-14 11:49:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:35,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658945042] [2022-12-14 11:49:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 11:49:35,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:35,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658945042] [2022-12-14 11:49:35,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658945042] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:35,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786165795] [2022-12-14 11:49:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:35,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:35,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:35,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:35,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:49:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:35,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:49:35,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 11:49:35,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:49:35,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786165795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:35,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:49:35,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 11:49:35,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436732530] [2022-12-14 11:49:35,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:35,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:49:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:35,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:49:35,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:49:35,456 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-12-14 11:49:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:35,622 INFO L93 Difference]: Finished difference Result 460 states and 681 transitions. [2022-12-14 11:49:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:49:35,622 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-12-14 11:49:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:35,624 INFO L225 Difference]: With dead ends: 460 [2022-12-14 11:49:35,624 INFO L226 Difference]: Without dead ends: 254 [2022-12-14 11:49:35,625 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-12-14 11:49:35,625 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-12-14 11:49:35,626 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-12-14 11:49:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-12-14 11:49:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 216. [2022-12-14 11:49:35,684 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-12-14 11:49:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 312 transitions. [2022-12-14 11:49:35,686 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 312 transitions. Word has length 56 [2022-12-14 11:49:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:35,686 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 312 transitions. [2022-12-14 11:49:35,686 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-12-14 11:49:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 312 transitions. [2022-12-14 11:49:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 11:49:35,687 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:35,688 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-12-14 11:49:35,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:49:35,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 11:49:35,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash -545552774, now seen corresponding path program 1 times [2022-12-14 11:49:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:35,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882062195] [2022-12-14 11:49:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-12-14 11:49:35,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:35,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882062195] [2022-12-14 11:49:35,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882062195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:35,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:35,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:49:35,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059656101] [2022-12-14 11:49:35,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:35,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:49:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:35,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:49:35,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:49:35,956 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-12-14 11:49:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:36,136 INFO L93 Difference]: Finished difference Result 283 states and 422 transitions. [2022-12-14 11:49:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:49:36,137 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-12-14 11:49:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:36,138 INFO L225 Difference]: With dead ends: 283 [2022-12-14 11:49:36,138 INFO L226 Difference]: Without dead ends: 281 [2022-12-14 11:49:36,138 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-12-14 11:49:36,139 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-12-14 11:49:36,139 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-12-14 11:49:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-12-14 11:49:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 240. [2022-12-14 11:49:36,204 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-12-14 11:49:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 351 transitions. [2022-12-14 11:49:36,205 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 351 transitions. Word has length 69 [2022-12-14 11:49:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:36,205 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 351 transitions. [2022-12-14 11:49:36,205 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-12-14 11:49:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 351 transitions. [2022-12-14 11:49:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 11:49:36,206 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:36,206 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-12-14 11:49:36,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 11:49:36,207 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash 805840168, now seen corresponding path program 1 times [2022-12-14 11:49:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:36,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694163555] [2022-12-14 11:49:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:36,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 11:49:36,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:36,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694163555] [2022-12-14 11:49:36,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694163555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:36,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:36,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:49:36,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031554091] [2022-12-14 11:49:36,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:36,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:49:36,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:36,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:49:36,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:49:36,225 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-12-14 11:49:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:36,318 INFO L93 Difference]: Finished difference Result 442 states and 651 transitions. [2022-12-14 11:49:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:49:36,319 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-12-14 11:49:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:36,320 INFO L225 Difference]: With dead ends: 442 [2022-12-14 11:49:36,320 INFO L226 Difference]: Without dead ends: 273 [2022-12-14 11:49:36,320 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-12-14 11:49:36,321 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-12-14 11:49:36,321 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-12-14 11:49:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-12-14 11:49:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 259. [2022-12-14 11:49:36,399 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-12-14 11:49:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 384 transitions. [2022-12-14 11:49:36,400 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 384 transitions. Word has length 68 [2022-12-14 11:49:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:36,400 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 384 transitions. [2022-12-14 11:49:36,400 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-12-14 11:49:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 384 transitions. [2022-12-14 11:49:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 11:49:36,401 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:36,401 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-12-14 11:49:36,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 11:49:36,401 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2068450044, now seen corresponding path program 1 times [2022-12-14 11:49:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:36,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648149037] [2022-12-14 11:49:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:36,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-12-14 11:49:36,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:36,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648149037] [2022-12-14 11:49:36,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648149037] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:36,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11773621] [2022-12-14 11:49:36,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:36,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:36,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:36,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:36,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:49:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:36,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 11:49:36,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-12-14 11:49:37,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-12-14 11:49:37,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11773621] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:37,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 11:49:37,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 12] total 23 [2022-12-14 11:49:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096503100] [2022-12-14 11:49:37,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:37,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 11:49:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:37,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 11:49:37,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-12-14 11:49:37,228 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-12-14 11:49:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:37,381 INFO L93 Difference]: Finished difference Result 265 states and 389 transitions. [2022-12-14 11:49:37,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:49:37,382 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-12-14 11:49:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:37,383 INFO L225 Difference]: With dead ends: 265 [2022-12-14 11:49:37,383 INFO L226 Difference]: Without dead ends: 263 [2022-12-14 11:49:37,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-12-14 11:49:37,384 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 11:49:37,384 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-12-14 11:49:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-12-14 11:49:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2022-12-14 11:49:37,463 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-12-14 11:49:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 380 transitions. [2022-12-14 11:49:37,464 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 380 transitions. Word has length 75 [2022-12-14 11:49:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:37,464 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 380 transitions. [2022-12-14 11:49:37,464 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-12-14 11:49:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 380 transitions. [2022-12-14 11:49:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 11:49:37,465 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:37,466 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-12-14 11:49:37,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 11:49:37,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 11:49:37,666 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash 215528780, now seen corresponding path program 1 times [2022-12-14 11:49:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:37,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420783685] [2022-12-14 11:49:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-12-14 11:49:37,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:37,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420783685] [2022-12-14 11:49:37,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420783685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:37,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069104051] [2022-12-14 11:49:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:37,738 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:37,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:49:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:37,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:49:37,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-12-14 11:49:37,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-12-14 11:49:37,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069104051] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:37,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [847237393] [2022-12-14 11:49:37,879 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 11:49:37,879 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:37,879 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:37,880 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:37,880 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:39,092 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2022-12-14 11:49:39,116 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:39,756 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-12-14 11:49:39,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:49:39,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:39,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-14 11:49:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918483495] [2022-12-14 11:49:39,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:39,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 11:49:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 11:49:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2022-12-14 11:49:39,758 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-12-14 11:49:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:40,062 INFO L93 Difference]: Finished difference Result 283 states and 415 transitions. [2022-12-14 11:49:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 11:49:40,063 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-12-14 11:49:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:40,064 INFO L225 Difference]: With dead ends: 283 [2022-12-14 11:49:40,064 INFO L226 Difference]: Without dead ends: 281 [2022-12-14 11:49:40,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 11:49:40,064 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 45 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:40,065 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.1s Time] [2022-12-14 11:49:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-12-14 11:49:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 261. [2022-12-14 11:49:40,141 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-12-14 11:49:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 383 transitions. [2022-12-14 11:49:40,142 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 383 transitions. Word has length 77 [2022-12-14 11:49:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:40,142 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 383 transitions. [2022-12-14 11:49:40,143 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-12-14 11:49:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 383 transitions. [2022-12-14 11:49:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 11:49:40,144 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:40,144 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-12-14 11:49:40,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 11:49:40,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:40,345 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:49:40,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:40,347 INFO L85 PathProgramCache]: Analyzing trace with hash 744962560, now seen corresponding path program 1 times [2022-12-14 11:49:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:40,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364136379] [2022-12-14 11:49:40,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-12-14 11:49:40,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:40,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364136379] [2022-12-14 11:49:40,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364136379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:40,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608593014] [2022-12-14 11:49:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:40,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:40,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:40,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 11:49:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:40,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 11:49:40,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-12-14 11:49:40,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-12-14 11:49:40,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608593014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:40,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [713608685] [2022-12-14 11:49:40,685 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 11:49:40,686 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:40,686 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:40,686 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:40,686 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:42,853 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 8 for LOIs [2022-12-14 11:49:42,856 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:43,949 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-12-14 11:49:43,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:49:43,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:43,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2022-12-14 11:49:43,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610268233] [2022-12-14 11:49:43,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:43,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 11:49:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 11:49:43,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2022-12-14 11:49:43,951 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-12-14 11:49:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:44,672 INFO L93 Difference]: Finished difference Result 389 states and 594 transitions. [2022-12-14 11:49:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 11:49:44,673 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-12-14 11:49:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:44,673 INFO L225 Difference]: With dead ends: 389 [2022-12-14 11:49:44,673 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 11:49:44,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 268 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 11:49:44,674 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 81 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:44,675 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.4s Time] [2022-12-14 11:49:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 11:49:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 11:49:44,675 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-12-14 11:49:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 11:49:44,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2022-12-14 11:49:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:44,675 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 11:49:44,675 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-12-14 11:49:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 11:49:44,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 11:49:44,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 11:49:44,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 11:49:44,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:44,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 11:50:42,844 WARN L233 SmtUtils]: Spent 56.53s 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-12-14 11:52:25,658 WARN L233 SmtUtils]: Spent 1.71m 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-12-14 11:53:22,694 WARN L233 SmtUtils]: Spent 56.65s 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-12-14 11:55:01,338 WARN L233 SmtUtils]: Spent 1.64m 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-12-14 11:55:08,458 WARN L233 SmtUtils]: Spent 7.12s 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-12-14 11:55:22,822 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-12-14 11:55:22,822 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-12-14 11:55:22,822 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-12-14 11:55:22,822 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-12-14 11:55:22,823 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-12-14 11:55:22,823 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-12-14 11:55:22,823 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-12-14 11:55:22,823 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-12-14 11:55:22,823 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 24 70) the Hoare annotation is: true [2022-12-14 11:55:22,824 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-12-14 11:55:22,824 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-12-14 11:55:22,824 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-12-14 11:55:22,824 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-12-14 11:55:22,824 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-12-14 11:55:22,825 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-12-14 11:55:22,825 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-12-14 11:55:22,825 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 11:55:22,825 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-12-14 11:55:22,826 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-12-14 11:55:22,826 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 11:55:22,826 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-12-14 11:55:22,826 INFO L899 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2022-12-14 11:55:22,826 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 35 68) 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-12-14 11:55:22,826 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-12-14 11:55:22,827 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-12-14 11:55:22,827 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-12-14 11:55:22,827 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2022-12-14 11:55:22,827 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-12-14 11:55:22,827 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-12-14 11:55:22,827 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-12-14 11:55:22,828 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2022-12-14 11:55:22,828 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-12-14 11:55:22,828 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-12-14 11:55:22,828 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-12-14 11:55:22,831 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-12-14 11:55:22,833 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:55:22,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:55:22 BoogieIcfgContainer [2022-12-14 11:55:22,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:55:22,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:55:22,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:55:22,858 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:55:22,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:49:26" (3/4) ... [2022-12-14 11:55:22,861 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 11:55:22,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-14 11:55:22,870 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-12-14 11:55:22,870 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-14 11:55:22,870 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 11:55:22,870 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 11:55:22,870 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 11:55:22,893 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-12-14 11:55:22,894 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-12-14 11:55:22,904 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 11:55:22,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:55:22,905 INFO L158 Benchmark]: Toolchain (without parser) took 356976.98ms. Allocated memory was 134.2MB in the beginning and 721.4MB in the end (delta: 587.2MB). Free memory was 102.9MB in the beginning and 482.0MB in the end (delta: -379.1MB). Peak memory consumption was 211.1MB. Max. memory is 16.1GB. [2022-12-14 11:55:22,905 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 134.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:55:22,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.28ms. Allocated memory is still 134.2MB. Free memory was 102.8MB in the beginning and 91.8MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 11:55:22,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.70ms. Allocated memory is still 134.2MB. Free memory was 91.8MB in the beginning and 90.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:55:22,906 INFO L158 Benchmark]: Boogie Preprocessor took 20.35ms. Allocated memory is still 134.2MB. Free memory was 90.2MB in the beginning and 89.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:55:22,906 INFO L158 Benchmark]: RCFGBuilder took 259.83ms. Allocated memory is still 134.2MB. Free memory was 89.1MB in the beginning and 75.0MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 11:55:22,906 INFO L158 Benchmark]: TraceAbstraction took 356388.54ms. Allocated memory was 134.2MB in the beginning and 721.4MB in the end (delta: 587.2MB). Free memory was 74.5MB in the beginning and 485.2MB in the end (delta: -410.7MB). Peak memory consumption was 408.4MB. Max. memory is 16.1GB. [2022-12-14 11:55:22,907 INFO L158 Benchmark]: Witness Printer took 47.21ms. Allocated memory is still 721.4MB. Free memory was 485.2MB in the beginning and 482.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 11:55:22,908 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.11ms. Allocated memory is still 134.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.28ms. Allocated memory is still 134.2MB. Free memory was 102.8MB in the beginning and 91.8MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.70ms. Allocated memory is still 134.2MB. Free memory was 91.8MB in the beginning and 90.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.35ms. Allocated memory is still 134.2MB. Free memory was 90.2MB in the beginning and 89.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.83ms. Allocated memory is still 134.2MB. Free memory was 89.1MB in the beginning and 75.0MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 356388.54ms. Allocated memory was 134.2MB in the beginning and 721.4MB in the end (delta: 587.2MB). Free memory was 74.5MB in the beginning and 485.2MB in the end (delta: -410.7MB). Peak memory consumption was 408.4MB. Max. memory is 16.1GB. * Witness Printer took 47.21ms. Allocated memory is still 721.4MB. Free memory was 485.2MB in the beginning and 482.0MB 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: 356.3s, OverallIterations: 20, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 337.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 2901 SdHoareTripleChecker+Invalid, 2.0s 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, 3.6s 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: 0.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 388 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 432 PreInvPairs, 645 NumberOfFragments, 4832 HoareAnnotationTreeSize, 432 FomulaSimplifications, 788494 FormulaSimplificationTreeSizeReduction, 326.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 4922709 FormulaSimplificationTreeSizeReductionInter, 11.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s 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: 97, 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: 1 - InvariantResult [Line: 35]: 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: 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-12-14 11:55:22,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a473ef4-51c5-496f-a594-857e84c737c9/bin/utaipan-gh47qXpMRh/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